Recursion means calling a method itself over and over again. It is a natural way to solve some problems. The main idea is to divide the problem into smaller pieces (decomposition) until a stopping (base) case is reached, and then combine the results back together (composition).

Solve the given problems by using recursion.

1) Design and implement a recursive algorithm to calculate the power of a number is calculated as follows:

power(base, p) = base * power(base, p - 1)

2) Design and implement a recursive function to find out whether a given string is a palindrome or not.

A palindrome is a word, number, phrase, or other sequence of characters which reads the same backward as forward, such as abba or racecar or the number 12321.