CHAPTER : LINEAR PROGRAMMING

SYLLABUS: Introduction, related terminology such as constraints, objective function,

optimization, graphical method of solution for problems in two variables, feasible and
infeasible regions (bounded or unbounded), feasible and infeasible solutions, optimal feasible
solutions (up to three non-trivial constraints.)

Definitions and Formulae:

1) Let R be the feasible region (convex polygon) for a linear programming problem and
let Z = ax + by be the objective function. When Z has an optimal value (maximum or
minimum), where the variables x and y are subject to constraints described by linear
inequalities, this optimal value must occur at a corner point* (vertex) of the feasible
region.
2) Let R be the feasible region for a linear programming problem, and let
Z = ax + by be the objective function. If R is bounded**, then the objective
function Z has both a maximum and a minimum value on R and each of these occurs
at a corner point (vertex) of R
Remark: If R is unbounded, then a maximum or a minimum value of the
objective function may not exist. However, if it exists, it must occur at a corner
point of R.
➢ Solving linear programming problem using Corner Point Method.
The method comprises of the following steps:
1. Find the feasible region of the linear programming problem and determine its corner
points(vertices) either by inspection or by solving the two equations of the lines
intersecting at the point.
2. Evaluate the objective function Z=ax+ by at each corner point. Let M and m,
respectively denote the largest and smallest values of these points.
3. (i) When the feasible region is bounded, M and m are the maximum and
minimum value of Z.
(ii) In case, the feasible region is unbounded, we have:
(a) M is the maximum value of Z , if the open half plane determined by
ax+ by >M has no point in common with the feasible region.
Otherwise, Z has no maximum value.
(b) Similarly, m is the minimum value of Z, if the open half plane determined by
ax+ by<m has no point in common with the feasible region.
Otherwise, Z has no minimum value.

205
 MULTIPLE CHOICE QUESTIONS

Q.NO QUESTIONS AND ANSWERS

1 Solution set of the inequality 2x + y > 5 is
a) Half-plane containing origin
b) Half plane not containing origin
c) xy-plane except the points on the line 2x + y = 5
d) No solution
Solution: Origin does not satisfy this inequality.
Ans: b
2 Objective function of a LPP is
a) constant graph
b) A function to be optimized
c) Inequality
d) Quadratic function
Solution: Objective function is a function to be optimized.
Ans: b
3 In an LPP, if the objective function Z = ax + by has same maximum at two corner
points of the feasible region, then the number of points at which maximum value
of Z occurs is
a) 0 b) 1 c) 2 d) infinite
Solution: every point on the line joining these two corner points gives same
maximum.
Ans: d
4 The corner points of the feasible region determined by a system of linear
inequalities are (0, 0), (4, 0), (2, 4) and (0, 5). If the maximum value of Z = ax +
by where a,b > 0 occurs at both (2, 4) and (4, 0), then
a) a = 2b b) 2a = b c) a = b d) 3a = b
solution: Z(2, 4) = Z(4, 0) => 2a + 4b = 4a => a = 2b
Ans: a
5 A linear programming problem is as follows:
Maximize /minimize objective function Z = 2x – y + 5 subject to constraints
3x + 4y ≤60, x + 3y ≤ 30, x ≥ 0, y ≥ 0.
If the corner points of the feasible region are A(0, 10), B(12, 6), C(20, 0) and O(0,
0), then which of the following are true
a) Maximum value of Z is 40

206
 b) Minimum value of Z is -5
c) Difference between maximum and minimum values of Z is 35
d) At two corner points the values of Z are equal
Solution: Z(0, 10) = 2x0 -10 + 5 = -5 is minimum value of Z Ans: b
6 A linear programming problem is as follows:
Minimize Z = 2x + y subject to constraints x ≥ 3, x ≤ 9, y ≥ 0, x – y ≥ 0, x + y ≤
14
The feasible region has
a) 5 corner points including (0, 0) and (9, 5)
b) 5 corner points including (7, 7) and (3, 3)
c) 5 corner points including (14, 0) and (9, 0)
d) 5 corner points including (3, 6) and (9, 5)
Solution: Five corner points as shown in the figure.

It includes (3,3) and (7, 7)

Ans : b
7 The objective function Z = ax + by of an LPP has maximum value 42 at (4, 6) and
minimum value 19 at (3, 2). Which of the following is true
a) a = 9, b = 1 b) a = 5, b = 2
c) a = 3, b = 5 d) a = 5, b = 3
solution: Z(4, 6) = 42 => 4a + 6b =42 Z(3, 2) = 19 => 3a + 2b = 19 solving we get
a = 3, b = 5
Ans:c
8 The corner points of the feasible region of a linear programming problem are (0,
4), (8, 0) and (20/3, 4/3). If Z = 30x + 20y is the objective function, then
(Maximum value of Z – Minimum value of Z) is equal to
a) 40 b) 96 c) 160 d) 136
Solution: Max. = Z(8, 0) =240 and Min. = Z(0, 4) = 80
Ans: c
9 The position of points O(0, 0) and P(2, -1) is-------, in the solution region of the
inequality 2y – 3x < 5
a) O is inside the region and P is outside the region

207
 b) O and P both are inside the region
c) O and P both are outside the region
d) O is outside and P is inside the region
Solution: Both O and P satisfy the inequality.
Ans: b
10 If the corner points of the feasible region of an LPP are (0, 2), (3, 0), (6, 0), (6, 8)
and (0, 5), then the minimum value of the objective function Z = 4x + 6y occurs
at
a) (0, 2) only
b) (3, 0) only
c) The midpoint of the line segment joining the points (0, 2) and (3, 0)
only
d) Every point on the line segment joining the points (0, 2) and (3, 0)
Solution: If Z has same min.value at two points, then Z has same min. value at
every point on the line segment joining the two points.
Ans: d

CHAPTER VIDEO LINK SCAN QR CODE FOR VIDEO

LINEAR
PROGRAMMING https://youtu.be/Zx0yeGYW0kw

EXERCISE

1 The feasible region of constraints x+ y ≤ 4, 3x+ 3y ≥18, x ≥ 0, y ≥ 0 defines on

.........
a) bounded feasible region
b) unbounded feasible region
c) feasible region in first and second quadrants
d) does not exist
2 The maximum value of Z = 3x+ 4y subject to constraints x+ y ≤ 4, x ≥ 0, y ≥ 0
is

208
 a) 16 b) 12 c) 0 d) not possible
3 Which of the following statement is correct?
(a) Every L.P.P. admits an optimal solution
(b) An L.P.P. admits a unique optimal solution
(c) If an L.P.P. admits two optimal solutions, it has an infinite number of
optimal solutions
(d) The set of all feasible solutions of a L.P.P. is not a convex set.
4 The shaded region in the given figure is the graph of.........

y
A(0,
3/2)

B(-
x
3/4,0)
O
(a) 4x– 2y≤3
(b) 4x– 2y≤–3
(c) 2x– 4y≥3
(d) 2x– 4y≤–3
5 Under the constraints x – 2y ≤ 6, x+ 2y ≥ 0, x ≤ 6, the maximum value of Z = 3x
+ 4y is
(a) 16 b) 17 c) 18 d) 19
ANSWERS:
1) d 2) a 3) c 4) a 5) c

ASSERTION AND REASONING QUESTIONS

The following questions consists of two statements-Assertion(A) and Reason(R).

Answer these questions selecting appropriate option given below.
a) Both A and R are true and R is the correct explanation for A
b) Both A and R are true and R is not the correct explanation for A
c) A is true but R is false
d) A is false but R is true

1 Assertion (A):The maximum value of Z = 5x + 3y, satisfying the conditions

x ≥ 0, y ≥ 0 and 5x + 2y ≤ 10, is 15

209
 Reason(R): A feasible region may be bounded or unbounded
Solution: corner points are (0, 0), (2, 0) and (0, 5)
Zmax =5x0 + 3x5 =15 at (0, 5)

So, both A and R are true but R is not the correct explanation for A
Ans: b
2 Assertion (A):The max. value of Z = x + 3y subject to 2x + y ≤ 20, x + 2y ≤ 20
x ≥ 0, y ≥ 0 is 30

Reason(R): The variables that are present in the problem are called decision
variables.
Solution: corner points are (0, 0), (10, 0), (20/3, 20/3) and (0, 10)
Zmax. =x + 3y = 0 + 3x10 = 30

both A and R are true but R is not the correct explanation for A
Ans: b
3 Assertion (A): The feasible region represented by 2x + 5y ≥ 80, x + y ≤ 20, x ≥ 0,
y ≥ 0 is bounded.
Reason(R): A region is said to be convex if the line joining any two of its
points lies completely in the region.
Solution: There is no feasible region
=> A is false R is true
Ans: d
4 Assertion (A): The maximum value of Z = 11x + 7y subjected to 2x + y ≤ 6, x ≤
2, x ,y ≥ 0, occurs at (0, 6)
Reason(R): If the feasible region of an LPP is bounded, then maximum and
minimum
Value of the objective function occurs at corner points.
Solution: corner points are (0, 6), (3, 2), (3, 0)
=> Z is max. at (3, 2) A is false , clearly R is true
Ans: d
5 The corner points of the feasible region for an LPP are (60, 0), (120, 0), (60, 30)
and (40, 20). The objective function Z = ax + by, a, b > 0 has maximum value
600 at points (120, 0) and (60, 30)
Assertion (A): Minimum value of Z is 300
Reason(R): a = 5, b = 10
Solution: Z = ax + by maximum value 600 at points (120, 0) and (60, 30)

210
 120a + 0 = 600 => a = 5

Also, 60a + 30b = 600 => 60x5 + 30b = 600 => b = 10

Z at (60, 0) = 5 x 60 + 0= 300 is min.
Ans: a
6 Assertion (A): If the feasible region of an LPP is bounded, then the objective
function Z = ax + by has both maximum and minimum values.
Reason(R): A feasible region of a system of linear inequalities is said to be
bounded if it can be enclosed within a circle.
Solution: conceptual /theory
Ans; b
7 Corner points of feasible region are (0, 0), (3, 0) and (0, 3) and the objective
function is Z = 4x + 3y
Assertion (A): Minimum value of Z is 9
Reason(R): Maximum value of Z is 21
Solution: Z is min. at (0, 3) => Z min. = 4x0 +3x 3 =9
Cleary, A is true and R is false
Ans: c
8 Assertion (A): The point (4, 2) does not lies in the half plane 4x + 6y – 24 < 0
Reason(R): The point (1, 2) lies in the half plane 4x + 6y – 24 < 0
Solution: Clearly A is true and R is false
Ans: c
9 Assertion (A): If the corner points of the feasible region for an LPP are (0, 4), (1,
4), (4, 1) and (12, -1), then the minimum value of the objective function Z = 2x +
4y is at (4, 1)
Reason(R): If the corner points of the feasible region for an LPP are (0, 4), (1,
4), (4, 1) and (12, -1), then the maximum value of the objective function Z = 2x +
4y is 20.
Solution: min = Z(4, 1) = 2x4 + 4x1 = 12, max.= Z(12, -1)= 2x12 + 4x(-1) = 20
Hence A is true and R is true but R is not correct explanation
Ans: b
10 The corner points of the feasible region for an LPP are (4, 0),(5, 0), (5, 3), (3, 5),
(0, 5) and (0, 4). The objective function Z = ax - by + 1900, a, b > 0 has maximum
value 1950 at (5, 0) and minimum 1550 at (0, 5).
Assertion (A): The value of Z at the point (5, 3) is 1740
Reason(R): a = 10, b = 70

211
 Solution: Z max.at (5, 0) = 1950 => 5a – bx0 + 1900 = 1950 => a = 10
Zmin.at (0,5) = 1550 => ax0 – bx5 + 1900 =1550 => b = 70
Z(5, 3) = 10x5 – 70x3 + 1900 = 1740
Ans : a

EXERCISE

1 Assertion: All feasible regions are convex sets

Reason: A set is said to be convex set if the line segment joining any two points
of the set, is completely within the set
2 Assertion: Graphical method is not suitable for solving all Linear programming
problems
Reason: Graphical method is applicable only in case of LPP having two variables
3 Assertion: The objective function describes the purpose of formulating LPP
Reason: The objective function can be maximized or minimized
4 Assertion: The objective function is always non-negative
Reason: The variables involved in the objective function are non-negative due to
constraints

ANSWERS:
1) d 2) a 3) a 4) a

2 MARKS QUESTIONS

1 Minimise Z = 13x – 15y subject to the constraints x + y ≤ 7, 2x – 3y + 6 ≥ 0, x ≥

0, y ≥ 0
Solution:clearly Z is min. at C(0, 2) and Zmin.= 13x0 -15x2 = 30

B(3, 4)
C(0, 2)

A(7, 0)
O
2 Maximise Z = 80x + 120y subject to the constraints 3x + 4y ≤ 60, x + 3y ≤ 30,
𝑥, 𝑦 ≥ 0
Solution: The corner points are (0, 0), (20, 0), (12, 6), (0, 10)

212
 y

C(0, 10)
B(12, 6)

A(20, 0) x
O
Corner points Z= 80x + 120y

(0,0) 0
(20, 0) 1600
(12, 6) 1680 maximum
(0, 10) 1200

3 Maximise Z = 100x + 120y subject to the constraints 5x + 8y ≤ 200, 5x + 4y

≤120, x,y≥0
Solution: Corner Z = 100x +
points 120y

(0, 0) 0
(0, 25) 3000
(24, 0) 2400
(8, 20) 3200

y
C(0, 25)

B(8, 20)

O A(24, 0) x
4 Maximise Z = 20x + 10y subject to the constraints 1.5x + 3y ≤ 42, 3x + y ≤ 24, x ,
y ≥0
Solution:

B(4, 12)

A(8, 0) x
O
213
 Corner points Z = 20x + 10y

(0, 0) 0
(8, 0) 160
(0, 14) 140
(4, 12) 200 maximum
5 Find max. value of Z = 3x + 4y subject to the constraints x + y ≤ 1, x, y ≥ 0
Solution:
y
(0, 1)

(1, 0)
x
O
Z(1, 0) = 3 + 0 =3
Z(0, 1) = 0+ 4 = 4 maximum
6 Find Zmax.=3x + 2y subject to the constraints x + y ≤ 2, x, y ≥0
Solution:
y
(0, 2)

(2, 0)
x
O
Corner Z = 3x + 2y
points
(0, 0) 0
(2, 0) 6 Max.
(0, 2) 4

7 Let Z = ax + by has optimal value at two points (2, 3) and (5, 7), then find the
relation between a and b
Solution: Z(2, 3) = Z(5, 7)
=> 2a + 3b = 5a + 7b
=> 3a + 4b = 0

8 Feasible region for an LPP is shown in the figure. Maximize Z =5x + 7y

214
 Solution:

C(0, 2)
B(3, 4)

A(7, 0) x
O

Corner points Z = 5x + 7y
(0, 0) 0
(7, 0) 35
(3, 4) 43 Maximum
(0, 2) 14
9 Maximise the function Z = 9x + 11y, subject to x ≤ 3, y ≤ 2, x, y ≥ 0
Solution:

x=3
y
(0, 2) (3, 2)
y=2

O (3, 0) x
Corner points Z =9x +11y

(0, 0) 0
(3, 0) 27 Maximum
(0, 2) 22
10 The feasible region for an LPP is shown in the figure. Find the min. value of Z =
11x +7y

O x
𝑥 + 3𝑦 = 9
𝑥 + 𝑦= 5

Solution:

215
 Corner points Z = 11x + 7y

(0, 3) 21 Minimum
(3, 2) 44
(0, 5) 35

EXERCISE

1 Find the maximum of Z = 6x + 16y subject to x + y ≥ 2, x, y ≥ 0

2 Find the maximum value of Z = 3x + 2y where the corner points of the feasible
region are (0, 0), (0, 8), (2, 7), (5, 4) and (6, 0)
3 Solve the linear inequation -3x + 2y ≥ 6 graphically
4 Find the maximum value of Z = 4x + 3y subject to x + y ≤ 10, x, y ≥ 0
5 Is the feasible region represented by x + y ≥ 1, x, y ≥ 0 bounded? Justify your
answer
ANSWERS:
1) 32 2) 23 4) 40
5) Unbounded from the graph

O 𝑥 + 𝑦 =1

3 MARK QUESTIONS

1 Maximise: Z = 3x + 9y subject to x + y ≥ 10, x + 3y ≤ 60, x ≤ y, x, y ≥ 0

Solution: On solving x + y = 10 and y – x = 0 we get (5, 5)
Similarly solving y – x = 0 and x + 3y = 60 we get (15, 15)

y 𝑦– 𝑥 = 0
(0, 20)

(15, 15)
(0, 10)

(5, 5)
O𝑥 + 𝑦 = 10 𝑥 + x3𝑦 = 60

216
 Corner points Z = 3x + 9y

(0, 20) 180 Maximum

(0, 10) 90
(5, 5) 60
( 15, 15) 180 Maximum
Zmax. = 180 at infinitely many
points on the line segment joining (0, 20) and (15, 15)
2 Maximise: Z = 5x + 10y subject to x + 2y ≤ 120, x + y ≥ 60, x -2y ≥ 0, x , y ≥ 0
Solution:
On solving x + y = 60 and x – 2y = 0 we get (40, 20)
On solving x + 2y = 120 and x – 2y = 0 we get (60, 30)

𝑥 – 2𝑦 = 0
(0, 60)
(60, 30)
(40, 20)
(120, 0)
(60, 0)
O x
𝑥 + 2𝑦 = 120
𝑥 + 𝑦 = 60
Corner points Z =5x + 10y

(40, 20) 400

(60, 0) 300 Minimum Zmin. = 300 at (60, 0)
(120, 0) 600
(60,30) 600

3 Maximise : Z = 300x + 190y subject to x + y ≤ 24, x + ½ y ≤ 16, x, y ≥ 0

Solution:
On solving x + y = 24, x + ½ y = 16 we get (8, 16)

y
C(0, 𝑥 + 1/2𝑦
24) = 16
B(8,
16)

O A(16, x
𝑥 + 𝑦
0)
= 24
Maximum value of Z is 5440 at (8, 16)

217
 EXERCISE

1 Maximise :Z = 6x + 3y subject to 4x + y ≥80, 3x + 2y ≤ 150, x + 5y ≥ 15, x, y ≥ 0

2 Minimise: Z = 200x + 500y subject to x + 2y ≥ 10, 3x + 4 y ≤ 24, x, y ≥ 0
3 Maximise: Z = 20x + 10y subject to 1.5x + 3y ≤ 42, 3x + y ≤ 24 , x, y ≥0
ANSWERS:
1) Zmax.= 285 at (40, 15)
2) Zmin. = 2300 at (4, 3)
3) Zmax. = 200 at (4, 12)

5 MARK QUESTIONS

1 Maximise : Z = 70x + 40y subject to 3x + 2y ≤ 9, 3x + y ≤ 9, x, y ≥ 0

Solution:

y
3𝑥 + 2𝑦 = 9
(0, 9/2)

O (3, 0) x
Corner points Z =70x + 40y

(0, 0) 0
(3, 0) 210 maximum
(0, 9/2) 180

Maximum value of Z is 210 at (3, 0)

2 Maximise : Z = 60x + 40y subject to 5x + 6y ≤ 45, 3x + 2y ≤ 18 , x, y ≥ 0
Solution:
On solving 5x + 6y = 45, 3x + 2y = 18 we get (9/4, 45/8)

y
3𝑥 + 2𝑦 = 18

B(8, 16)

O 𝐴(6, 0) x
5𝑥 + 6 𝑦 = 45

218
 Corner points Z =60x + 40 y

(0, 0) 0
(0, 15/2) 300
(9/4, 45/8) 360 Maximum
(6, 0) 360Maximum
Maximum value of Z is 360 at any
point on the line segment joining (6, 0) and (9/4, 45/8)

3 Minimise: Z = 5x + 7y subject to 2x + y ≥ 8, x + 2y ≥ 10 , x, y ≥ 0
Solution:
On solving 2x + y = 8, x + 2y =10 we get (2, 4)

y
(0,8)

(2, 4)

(10, 0)
O 2𝑥 + 𝑦 = 8 x
𝑥 + 2𝑦 = 10

Corner points Z = 5x + 7y

(10, 0) 50
(2, 4) 38 Minimum
(0, 8) 56

The minimum value of Z is 38 at (2, 4)

EXERCISE

1 Minimise : Z = 5x + 2y subject to x – 2y ≤ 2, 3x + 2y ≤12, -3x + 2y ≤ 3, x, y ≥ 0

2 Minimise : Z =x +2y subject to x + 2y ≥ 100, 2x – y ≤ 0, 2x + y ≤ 200, x, y ≥ 0
3 Minimise : Z = 3x + 5y subject to x + 2y ≥ 10, x + y ≥ 6, 3x + y ≥ 8, x, y ≥ 0
1) Zmin = 0 at (0 , 0)
2) Zmin = 100 at all points on the lin segment joining (0, 50) and (20, 40)
3) Zmin = 26 at (2, 4)

219
 CASE BASED QUESTIONS

1 A dealer Ram Singh residing in a rural area opens a shop to start his business with
an investment of Rs.5760. He wishes to purchase ceiling fans and table fans. A
ceiling fan costs him Rs. 360 and table fan costs Rs.240
Based on the above information answer the following questions.
i) Ram Singh purchases x ceiling fans and y table fans. He has space
in his store for at most 20 items. Write its constraint
ii) If he sells ceiling fan at a profit of Rs. 22 and table fan for a profit
of Rs. 18, then express the profit Z in terms of x and y
iii) What is the maximum profit of selling all the fans
Solution: i) He has space in store for at most 20 items => x + y ≤ 20
ii) profit on ceiling fans = Rs.22, Profit on table fans = Rs18
Hence Z = 22x + 18y
iii)360x + 240y ≤ 5760 => 3x + 2y ≤ 48
also x +y ≤20 and x,y ≥ 0
on solving we get the corner points(0, 0), (16,0), (8, 12), (0, 20)
Maximum value of Z occurs at (8, 12)
Zmax. = 22x8 + 18x12 = 392
2 The students of class XII are asked to write linear inequalities in two variables.
They have written : 3x + 5y ≤ 15, 5x + 2y ≤ 10, x ≥ 0 and y ≥ 0
Based on the above information answer the following questions.
i) Draw the feasible region of above system of inequalities
ii) Find the corner points of the solution region
Solution: i)
y
C(0, 3)
B(20/19, 45/19)

O A(2, 0) x
(ii) corner points are (0, 0), (2, 0), (20/19, 45/19) and (0, 3)
3 Corner points of a feasible region of an LPP are (0, 0), (7, 0), (6, 2), (0, 5).
Let Z = 3x + 4y be the objective function
Based on the above information answer the following questions.
i) The minimum value of Z occurs at

220
 a) (7, 0) b) (6, 2) c) (0, 5) d) (0, 0)
ii) The maximum value of Z occurs at
a) (7, 0) b) (6, 2) c) (0, 5) d) (0, 0)
iii) Maximum value of Z – Minimum value of Z is equal to
a) 26 b) 28 c) 21 d) 20
iv) The feasible solution of LPP belongs to
a) First and second quadrants b) First and third quadrants
c) Only second quadrant d) Only first quadrant
Solution:
Corner point Z = 3x + 4y
(0, 0) 0 Minimum
(7, 0) 21
(6, 2) 26 Maximum
(0, 5) 20

i) d ii) b iii) a iv) d

EXERCISE

1 In an LPP, the objective function Z =3x + 4y + 370 is to be optimized subjected to

the constraints : x + y ≥ 10, x + y ≤ 60, x ≤ 40, x, y ≥ 0
Based on the above information answer the following questions.
i) The maximum value of Z occurs at
a) (40, 0) b) (40, 20) c) (20, 40) d) (0, 40)
ii) The minimum value of Z is
a) 300 b) 400 c) 500 d) 600
iii) The value of Z at (40, 20) is
a) 490 b) 530 c) 550 d) 570
iv) Max. Z – Min. Z =
a) 190 b) 210 c) 230 d) 250

221
 2 The feasible region of an LPP is shown in the figure.

y
C(0, 50)
B(30, 20)

A(40, 0) x
O
i) Equation of AB is
a) 2x + y = 80 b) x + y = 50 c) x + 2y = 50
d) x + y = 40
ii) Equation of BC is
a) 2x + y = 80 b) x + y = 50 c) x + 2y = 50
d) x + y = 40
iii) Constraints are
a) x + y ≤ 50, 2x + y ≤ 80, x ≥ 0, y ≥ 0
b) x + y ≤ 50, 2x + y ≥ 80, x ≥ 0, y ≥ 0
c) x + y ≥ 50, 2x + y ≤ 80, x ≥ 0, y ≥ 0
d) None of these
iv) The objective function Z = 10500x + 9000y is maximum at the point
a) A b) B c) C d) O

ANSWERS:
1) i) a ii) b iii) a iv) d

2) i) a ii) b iii) a iv) b

222