Consider the algorithm

Procedure $fct(n$ : integer$)$

if $n=0$ then return $1$

else return $fct(n-1)+2(n+1).$

List all the steps the algorithm uses to calculate $fct(3).$ Then show, using induction, that $fct(n)=n^2+3n+1,$ for all $n0.$