Consider an optimization problem of the form ()minimizex=Xf(x)=6x1+2x2+9x3 such that 1x1x2x30 xi0i=1,2,3 Part a. Sketch the feasible set. Part b. Identify the extreme points of the polytope which defines the feasible set. Part c. Evaluate the cost function at i. The extreme points found in part b ii. A few random points within the feasible set