Infeasibility in a linear programming problem occurs when: a. there is an infinite solution
b. a constraint is redundant
c. more than one solution is optimal
d. the feasible region is unbounded
e. there is no solution that satisfies all the constraints given

what shape is

but there’s no any figure there!

answer: 5

step-by-step explanation:

since, the range is the difference between the lowest and highest values of the given sample space.

and, here the sample space = { 3, 1, 0, 4, 1, 4, 2, 3, 0, 5, 0, 1, 1, 2, 0, 4, 1,4, 4 ,2 ,3 ,2 ,0 ,1 ,4 }

here, the highest value of the given sample = 5

and, the lowest value = 0

therefore, the range of the sample space = 5 - 0 = 5