Show me the steps to solve the following recurrence relations using any of the following

methods: unrolling, tail recursion, recurrence tree $($include tree diagram$),$ or expansion T $($n$)=$ T $($n $1)+2$n if n $>1,$ and T $(1)=3$ otherwise T $($n$)=$ T $($n$1/2)+1$ if n $>2,$ and T $($n$)=0$ otherwise