apply recursion to linear and binary search method

Explain the halting condition for the recursive binary search and why all recursive algorithms need one.

Write a recursive implementation of Euclid's Algorith for finding the greatest common divisor(GCD) of two intergers. Descriptions of this algorithm are available in algebra books and on theweb. (Note: A nonrecursive version of the GCD problem was given in the programming exercisesfor Chapter 7.) Write a test program that calls your GCD procedure five times, using thefollowing pairs of integers: (5,20),(24,18),(11,7),(432,226),(26,13). After each procedure call,display the GCD.

Give an account of the stopping condition for the recursive binary search, and elaborate on why such a condition is required of all recursive algorithms.