For each of the following problems, indicate which are in P and
which are in NP. Forthose you think are in P, give an outline of the algorithm to solve
them. For those you think arein NP, explain why you think they are not solvable in polynomial
time. (Hint: think about analgorithm to solve these problems, and then determine if it is
polynomial.)a. The Smarandache function, S(k), gives the smallest integer m, so
that m! can be evenlydivided by k....