Verify by induction that the function below computes $2(3$n$)$ for all n $>=0.$

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

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

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

return p