6. Show that the linear programming problem given in Question 3(a) can be expressed in matrix notation as Maximise cx subject to Ax b x0 where c, x, and 0 are 2 x 1 matrices, A is a 3 x 2 matrix and b is a 3 x 1 matrix, which should be stated.