Consider the following function:

$F_1=2,F_n=(F_{n-1}{)}^2,n2$

Select one or more:

a$.$ The complexity of the algorithm$/$program that computes $F_n$ is $O(2^n)$ if $F_n$ is

implemented as follows:

$F(N)=F(N-1)*F(N-1)$

b$.$ The complexity of the algorithm$/$program that computes $F_n$ is $O(logn)$ if $F_n$ is

implemented as follows:

$F(N)=$power$(F(N-1),2)$

C$.$ The complexity of the algorithm$/$program that computes $F_n$ is $O(n^2)$ if $F_n$ is

implemented as follows:

$F(N)=$power$(F(N-1),2)$

d$.$ The complexity of the algorithm$/$program that computes $F_n$ is $O(1)$ if $F_n$ is

implemented as follows:

$F(N)=F(N-1)*F(N-1)$

e$.$ The complexity of the algorithm$/$program that computes $F_n$ is $O(n^2)$ if $F_n$ is

implemented as follows:

$F(N)=F(N-1)*F(N-1)$

f$.$ The complexity of the algorithm$/$program that computes $F_n$ is $O(n)$ if $F_n$ is

implemented as follows:

$F(N)=$power$(F(N-1),2)$