Consider the following procedure, which takes as input an array A:

Algorithm $1$: The recursive function printStuff

Function printStuff$($A$)$:

n $$ length of A

if n $<=4$ then

return

for i $=0,...,$ n $1$ do

print A$[$i $]$

printStuff $($A$[$:n$/4])$

printStuff $($A$[3$n$/4$:$])$

return

What is the asymptotic running time of printStuff?

$[$We are expecting: The best answer you can give of the form $$The running time of

printStuff is O$(...)$ and a short explanation.