Consider linear search. That is$,$ given integers x and X$1,$ X$2,...,$ Xn$,$ determine whether x is contained in $21,22,...,$ Xn by comparing x with X$1,$ X$2,...,$ In one at a time. Is this problem in P$?$ If yes, provide a proof. If no$,$ why not? Is this problem in NP$?$ If yes, provide a proof. If no$,$ why not? Your answer should mention Turin XD$03$ g machines.