you can assume a base case of T$(1)=$ T$(2)=1.$

$$ Part $1(10$ points$)$ Say you had an algorithm with recurrence formula

T$($n$)<=81$T$($n$/3)+$ n

$3$

$.$ Use a recursion tree $($or recursion table$)$ to

solve for T$($n$).$ No need for induction on this one.