In the solution of a linear programming problem by simplex method, if during an iteration, all ratios of right – hand side 
to the coefficients of entering variable a are found to be negative, it implies that the problem has:
(a) Infinite number of solutions
(b) Infeasible solution
(c) Degeneracy
(d) Unbound solution