# How many lines does his algorithm print? Write a recurrence and solve it.function printaton(n: an integer power of 2) {               if n > 1 {                      printaton(n/2)                       printaton(n/2)                      printaton(n/2)                      for i = 1 to n ^ 4 do                            printline("are we done yet?")                }} a. Use Master's theorem to obtain an asymptotic solution. b. Derive an exact solution by expanding the recurrence.

Question

How many lines does his algorithm print? Write a recurrence and solve it.
function printaton(n: an integer power of 2) {
if n > 1 {
printaton(n/2)
printaton(n/2)
printaton(n/2)
for i = 1 to n ^ 4 do
printline("are we done yet?")
}
}

a. Use Master's theorem to obtain an asymptotic solution.

b. Derive an exact solution by expanding the recurrence.