Consider the following function:

F$1=2,$ Fn $=($Fn$1)2$ n $>=2$

Question $8$Select one or more:

a$.$

The complexity of the algorithm$/$program that computes Fn is O$($n$2)$ if Fn is implemented as follows:

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

b$.$

The complexity of the algorithm$/$program that computes Fn is O$($n$2)$ if Fn is implemented as follows:

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

c$.$

The complexity of the algorithm$/$program that computes Fn is O$(2$n$)$ if Fn is implemented as follows:

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

d$.$

The complexity of the algorithm$/$program that computes Fn is O$($log n$)$ if Fn is implemented as follows:

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

e$.$

The complexity of the algorithm$/$program that computes Fn is O$($n$)$ if Fn is implemented as follows:

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

f$.$

The complexity of the algorithm$/$program that computes Fn is O$(1)$ if Fn is implemented as follows:

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