Solve this by creating a .rkt file with the definition of the following function using Racket.

Show your code and also the result of your code.

(power base exponent) computes base xponent using the following recursive definition. Tl (bi) if n > 0 and n is even (b^.bif n > 0 and n is odad bn = This recursion is significantly more efficient for large exponents than the one discussed in class. However, in order to implement it efficiently, the code can only make one recursive call to compute bbrb_. Accomplish this by using let and a lambda expression to define a squaring function within the definition of the function power