Consider the following pseudo code of a recursive algorithm:

Algorithm $F(n)$

if $n==3$ then

return $1$

else

$S=n+3$

return $F(n-1)+S$

Which of the following is the recurrence relationship for the number of basic operations of

addition?

$C(n)=C(n-1)+2,C(3)=1$

$C(n)=C(n-1)+1,C(3)=1$

$C(n)=C(n-1)+2,C(3)=0$

$C(n)=C(n-1)+3,C(3)=0$

$C(n)=C(n-1)+1,C(3)=0$