$(15$ points$)$ Use induction to verify the candidate solution to the following recurrence equation.

t$\_($n$)=$t$\_($n$-1)+$n$^(2)$ for n$>1$

t$\_(1)=1$

The candidate solution is t$\_($n$)=($n$($n$+1)(2$n$+1))/(6)$