A linear programming problem is said to be unbounded if:$*$

a$)$ There is no feasible solution

b$)$ The objective function can increase indefinitely

c$)$ The constraints are inconsistent

d$)$ None of the above