Write a recurrence relation H

$($

n

$)$

$$to describe how many lines of output

the program shown below would produce. Assume that n is a power of

$2$

$.$

$$Next$,$ remove

all instances of H

$($

n

$)$

$$from the RHS of your recurrence relation and, as a function of n

$,$

$$use

big

$-$

$\backslash$

Theta

$($

$)$

$$notation to describe the number of lines of output.