Question $1(10$ marks$)$:

Using Big O Notation, determine which of the algorithms below for computing xn is more efficient. Provide a detailed analysis of the time complexity for each algorithm. Assume $x$ is a real number and $n$ is an integer.$//$ Algorithm B double power$($double x$,$ int n $)\{$ double result $=$x; i$.$f $($n$==$theta$)\{$ return $1$; $\}$elsereturn x $*$ power $($x$,$n$-1)$;