Consider the problem of int exponentiation. That is$,$ given two non$-$negative int variables $n$ and $k,$ find

pow$(n,k)=n^k$

While library methods such as Math. pow do exist, they sometimes only provide a floating point approximation of the solution due to their use of the double datatype. Using recursion we can define multiple algorithms for solving this problem exactly $($no approximations$)$ based on slightly different problem decompositions.

Each of the pow methods presented in this exam is a valid algorithm for solving int exponentiation under the following assumptions: i$)$ n and k contain non$-$negative int values; and ii$)$ the overall solution fits in an int variable.