"Max z=cx s.t. Ax=b,x>=0 " is a non-degenerate LP in standard form. The LP has 4 constraints and 7 decision variables. (a) How many positive values does a bfs have (b) How many 0 values does a bfs have (c) How many coordinates does the vector b have (d) Answer T or F : If v is an optimal solution and Au=b for some other u>=0, then cu=cv