Exercise 7.12 (Degeneracy in the assignment problem) Consider the polyhedron Pk2 defined by the constraints i=1kfij=1,j=1,,k,j=1kfij=1,i=1,,k,fij0,i,j=1,,k. (a) Show that P has k ! basic feasible solutions and that if k>1, every basic feasible solution is degenerate. (b) Show that there are 2k1kk2 different bases that lead to any given basic feasible solution