In Linear Programming each problem (called primal) has a dual. About duality in Linear Programming following statements are given :

(a)    If a Linear Programming problem is maximizing type, then its dual is minimizing type
(b)    Both primal and dual have same optimum value 
(c)    Dual of dual of a linear programming problem is primal problem
(d)    If maximizing linear programming problem is with “less than” type constraints, the dual of this problem will have “more than” type constraints
Choose from the following options :