Algorithms Question

Answer question fully for thumbs up.

Question 4 Consider the following algorithm with a positive integer as input: ALGORITHM Mystery (x) //Input: A positive integer x //Output:? sum 0 while x 2 1 do sum sum + x mod 10 return sum Here x mod 10 is the remainder of dividing x by 10 and lx/10] is the integer part of x/10, i.e., the largest integer smaller than or equal to x/10; the fractional part is discarded. (a) (b) What does the algorithm output? Determine the number of basic operations and the big-O class of the algorithm. Provide an explanation (you can assume that x is the power of 10, ie., x = 10k, k 0)