The a^n was pretty easy:function powN(a, n) {    if(n == 0) return 1;    return a * powN(a, n - 1);};But somehow I got stuck on a^(2^n), any suggestions or even a hint?I need a recursive algorithm that solves: a^(2^n).
Recursive algorithm - a^(2^n)
algorithms;recursion