Problem
1. The recursive definition of function Power requires a positive value for an exponent, yet A0 is simply 1. Change the function so that the parameter N is type Natural rather than Positive and returns the correct value when N is 0.
2. Write an Ada function that implements the recursive formula: F(N) F(N 1) F(N 2) = F(N 3) with base cases F(0)= 1, F(1) 2, and F(2) =. 3.