$(10$ Points$)$ Solve the following recurrence using the recurrence tree method. You need to show

your work to get the credits.

$T(N)=T_0{?}_{+}T(N-1)+N,N1,T(0)=0$Solve the following recurrence using the recurrence tree method. You need to show your work to get the credits.

T$($N$)=$ T$(0)+$ T$($N$-1)+$ N$,$ N $1,$ T$(0)=0$