Let f(x)=12xTQx-bTxbe a quadratic function over R2 withQ=[2005],b=[34]Consider the optimization problem:minxinxf(x)(a) For the unconstrained problem with x=Rn, find the global minima off.(b) Consider the constrained optimization problem with x={x|xinR2,x1+x22,x10,x20}. Solvethe conditional Gradient Descent method for two iterations starting with x0=[10]T and assuming k=1,for k=0,1.(c) For each of the three extreme points (0,0),(2,0),(0,2), determine whether they are a local minima or not.(d) does the algorithm converge if you continue the part (b) for k2, and with k=1,AAk ?