Implement programming problems 6 and 12 below at the end of chapter 15.

You should implement the two problems as two functions and use one

main program. Your main program should use a look with the following

interface (see blow). choosing 1 prompts the user to enter a string for the

Palindrome function. Choosing 2 prompts the user to enter x and y values

and runs GCD. Choosing 3 quits the loop and the program.

choose A Program:

1- Run the Palindrome

2- Run the GCD

3- Quit

Problem 6:

A palindrome is a string that reads the same both forward and backward.

For example, the string "madam" is a palindrome. Write a program that uses a

recursive function to check whether a string is a palindrome. Your program must contain

a value-returining recursive function that return true if the string is a palindrome and false

otherwise. Do not use any global variables; use the appropriate parameters.

Problem12:

(Greatest Common Divisor) Given two integers x and y, the following recursive

definition determines the greatest common divisor of x and y, written gcd(x,y):

gcd(x,y) = {xif y = 0

{gcd(y, x%y)if y /= 0

Note: in this definition function, gcd, that takes as parameter, two integers and returns the

greatest common divisor of the numbers. Also, write a program to test your function.