FOr the problem, Max(-x_1 - 2x_2 + 3x_5) x_1 + x_2 + 2x_3 + 3x_4 + x_5 <= 1 2x_1 - x_2 + 4x_3 + 6x_1 - x_5 <= 2 x_j >= 0, j= 1,......,5 A) show that x_1 = 1, x_2= x_3= x_4= x_5 = 0 is a basic feasible solution. B) Find two different dictionaries..(i.e. Not obtained by permuting the rows) that have this point as a basic solution. C) How many different dictionaries have this point as basic solution. i am so lost.. especially in part b and c. please help..any hint or help would be really appreciated! thanks.