Question: Define a recursive function fastExpo(a, n) that performs fast exponentiation i.e. fastExpo(a. n) = aAn where n is an integer. Write comments in your code

Define a recursive function fastExpo(a, n) that performs fast exponentiation i.e. fastExpo(a. n) = aAn where \"n" is an integer. Write comments in your code to highlight the important components of a recursive function. Comments carry 3 out of the total 10 marks for this
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
