Consider the following recursive algorithm.

$1.$ Algorithm F$($n$)$

$2.$ if n $=1$

$3.$ return $1$

$4.$ else

$5.$ return F$($n $-1)+2$

Assume that P$($n$)$ indicates the number of plus operation$($s$)$ to be executed in the line number $5.$ Using the notation, you are going to represent the initial condition of the recursive algorithm. Select the correct one.

a$.$ P$(1)=1$

b$.$ None of these.

c$.$ P$(0)=1$

d$.$ P$(0)=0$

e$.$ P$(2)=2$