Write Programs in Python:1. Recursive Power MethodDesign a function that uses recursion to raise a number to a power. The function should accept two arguments: the number to be raised, and the exponent. Assume the exponent is a non-negative integer.2. Ackermann's FunctionAckermann's Function is a recursive mathematical algorithm that can be used to test how well a system optimizes its performance of recursion. Design a function ackermann(m, n), which solves Ackermann's function. Use the followin

#Concepts Floyd-Warshall Algorithm, All-Pairs Shortest Path, Ad... | Filo

Fibonacci series program in python using recursive method