Recursion and Big O Examine the pseudocode below. (Recall that integer division rounds down any fractional values to the nearest whole number and that % is the modulus operator which returns the...

Recursion and Big O
Examine the pseudocode below. (Recall that integer division rounds down any fractional values
to the nearest whole number and that % is the modulus operator which returns the remainder after
doing integer division.)
Algorithm RecursiveFunction(n) // n is an integer
if (n > 0)
RecursiveFunction(n/2)
PrintOut(n%2)
endif
A. What is the output of this algorithm if it is initially called with 10 for n? Explain how you
arrived at that answer; that is, show your work, including the call stack for the execution of his
function at each step.