Question I $(10$ points$)$: Consider the following code: public void method$($int n$)\{$ if$($n $>0)\{$ method$($n$-1)$; System.out.print$($n$)$; method$($n$-1)$; System.out.print$($n$)$; method$($n$-1)$; $\}\}$ a$)$ Write a recurrence relation that represents the number of times the print statement is executed. b$)$ Solve the recurrence relation then write the result in term of $$ notation.