8. 5 points Consider the following algorithm that computes whether or not a given integer n is prime or composite input : An integer n output: true if n is prime, false otherwise for k 2,, Vn do if n mod k 0 then l output false; end end output true; (a) Identify the input, the input size, and the elementary operation. (b) Analyze the algorithm's running time with respect to the input size n. (c) Provide a Big-O characterization of the algorithm. Does this algorithm run in polynomial time with respect to the input size? Why or why not