Which of the following situations cannot occur in the context of a linear programming problem with n variables and n constraints?

Question $3$Answer

a$.$

The simplex algorithm does not terminate within a time that is polynomial in n

b$.$

The simplex algorithm terminates at a solution not corresponding to an extreme point

c$.$

The feasible region has $2^$n extreme points

d$.$

The feasible region has fewer than $2^$n extreme points

e$.$

None of the above