Find the worst$-$case complexity function T$($n$)$ of the below algorithm as a recurrence relation, considering only comparison and arithmetic operations. Mark the option which also specifies the complexity of the algorithm correctly.

procedure compute$($n: nonnegative integer$)$

if n $=0$ then p :$=1$

else if n $=1$ then p :$=2$

else if n $=2$ then p :$=3$

else p :$=$ compute$($n $-1)*$ compute$($n $-2)*$ compute$($n $-3)$

return p