Consider the linear programming problem: Maximise z = 4x1 + 2x2 + 7x3 subject to 2x1 x2 + 4x3 18 4x1 + 2x2 + 5x3 10 xi 0, i = 1, 2, 3 . (a) Transform this problem to a problem in canonical form. (b) For each extreme point of the new problem, identify the basic variables. (c) Which of the extreme points are optimal solutions to the