Consider the following function:

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

$($a$)$ What is the complexity of the algorithm that computes $F_n$ using the recursive definition given above?

$($b$)$ Describe a more efficient algorithm to calculate $F_n$ and give its running time.