11.Solve the linear programming problem by the simplex method. Maximize p=3x+4y Subject to x+y _0.y>_0 A) X=4 y=0 u=0 v=1 p=16 B)x=4 y=0 u=1 v=0p=16

11.Solve the linear programming problem by the simplex method. Maximize p=3x+4y Subject to x+y<_4 x>_0.y>_0 A) X=4 y=0 u=0 v=1 p=16 B)x=4 y=0 u=1 v=0p=16 C)x=4 y=4 u=1 v=0 p=-16 D) x=0y=4 u=1 v=0 p=16 E) x = 0; y = 4; U = 0; v = 2: P = 16 12.Solve the linear programming problem by the simplex method. Maximize p=5x+8y+72 Subject to x+y +z<_6 x>_0.y>_0z>_0 A) x = 0, y = 0, z = 2, u = 4, V = 0, P = 75 B) x = 0, y = 2, z = 4, u = 0, v = 0, P = 44 C) x = 0, y = 0.2 = 0, u = 2, v = 4, P = 79 D) x = 2, y = 4, z = 0, U = 0, v = 0, P = 28 13.Solve the linear programming problem by the simplex method. Maximize p=5x+2y+22 Subject to x+y+z<_32 _82>_0.y>_02_0 A) x = 13, y = 1, z = 0, u = 18, V = 0, w = 0, P = 67 B) x = 1, y = 0, z = 13, u = 18, v = 0, w = 0, P = 116 C) x = 0, y = 13, z = 0, u = 18, V = 0, w = 0, P = 47 D) x = 0, y = 0, z = 1, u = 18, V = 0, w = 0, P = 48