ForeachofthefollowingstateTrueorFalse:

$($a$)$ A minimization LP cannot be unbounded. $(4)$

$($b$)$ An LP that has a degenerate BFS must have all BFS degenerate. $(4)$

$($c$)$ At the end of the Simplex method, all slack variables must be non$-$basic. $(4)$

$($d$)$ If the objective function remains the same after an iteration of the Simplex method, $(4)$ the BFS must be degenerate.

$($e$)$ At each iteration of the Simplex method the objective function remains the same or $(4)$ strictly improves.