F(A, B) /I A, B are two positive integers with B>1 k=1; while A> 0 do X [k] = mod B A = A div B print(Xj]) For j k-1 downto 1 [2%] What will be the output if (i) A = 15, B-3; (ii) A = 142, B-8 [396] Guess what the algorithm does. [596] Give an asymptotically (worst case) tight bound for the running time of the algorithm. Explain your answer. a) c)