Suppose the canonical form of a liner programming problem is given by the constraint matrix 𝐀 and resource vector 𝐛, where 𝐀=[ 3 0 1 1 0 2 1 0 0 0 4 0 3 0 1] and 𝐛=[ 5 3 6] . Determine which of the following points is (i) a feasible solution to the linear programming problem. (ii) an extreme point of the set of feasible solutions. (iii) a basic solution. (iv) a basic feasible solution. For each basic feasible solutio