Consider the following conditions : (a) The solution must be feasible, i.e. it must satisfy all the supply and demand constraints. (b) The number of positive allocations must be equal to m+n-1, where m is the number of rows and n is the number of columns. (c) All the positive allocations must be in independent positions. The initial solution of a transportation problem is said to be non-degenerate basic feasible solution if it satisfies : Codes : (A) (a) and (b) only (B) (a) and (c) only (C) (b) and (c) only (D) (a), (b) and (c)