Advanced level school computer science. need helps. thanks.

The algorithm defines a recursive function named K that takes two parameters. FUNCTION K(number, base) /umber and base are integers DECLARE digitstring, tempstring, digit : STRING DECLARE remainder, quotient : INTEGER digitstring "0123456789ABCDEF" IF number =0THEN RETURN "" ENDIF remainder number MOD base digit digitString[remainder] //base-0 indexing quotient INTEGER (number / base) tempstring K (quotient, base) RETURN CONCATENATE(tempstring, digit) //tempstring+digit ENDFUNCTION (a) Copy and complete the trace table for function call K(42,16). (b) What is the purpose of function K ? (c) What is the range of base values for which this algorithm can accurately perform conversions? (d) State and explain 2 input validation checks that can be performed before number conversion. (e) How does this recursive function utilise memory through the call stack