An unbound solution of a linear programming problem is reflected in the simplex method, when
(a) All the ratio of ‘right hand sides’ to coefficients in key column become negative
(b) All the ratios of right hand sides to coefficients in key columns become zero
(c) All right hand sides become negative
(d) All right hand sides become zero