Consider the following recursive algorithm.

Algorithm $F(n)$

if $n=1$

return $1$

else

return $E(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 recurrence relation of the recursive algorithm. Select the correct one.

$P(n)=n$

$P(n)=P(n-1)+1$

$P(n)=P(n-1)+2$

$P(n)=n-1$

None of these.