Example of hand execution technique:

Recursive Hand Executions. Hand execute the following recursive algorithm using the techniques used in class. Draw a box indicating each call to f. Draw boxes indicating local and global variables. Show the values passed and returned. Show the changes to each variable. Show the output. Pow(long int X, unsigned int N) { if(N == theta) return 1; if(N == 1) return X; if(IsEven(N)) return Pow(X * X, N/2); else return Pow(X * X, N/2) *X;} main() { int answer = Pow(2, 21);} int a[4] = {42, 43, 44, 45} main { foo (3);} int foo (int n) { int tenp p = a[n], if (n > 0) a[n] = foo(n - 1) return temp;}