Below is the Simplex table of a basic feasible solution (BFS) of a linear programming problem where some values are represented by letters. X] RHS X5 3 Z a b 4 -1 d X; 0 1 0 0 0 0 0 1 e -1 -4 XS f 0 1 0 h 2 3 -3 If this is a maximization problem, what are the conditions so that the problem has unbounded optimal solution? Ltfen birini sein: O a. h > 0, b 0, a 0, a > 0 O e. Not possible