The Babylonian algorithm to compute the square root of a number n is as follows:

1) Make a guess at the answer (n/2 is good enough, so is 1).

2) Compute r = n/guess

3) Set guess = (guess+r)/2

4) Repeat steps 2 and 3 as many times as necesary. The more times we repeat
steps 2 and 3, the closer guess will become to the square root of n.

a) Write a program that inputs an integer n, iterates through the
babylonian algorithm five times, and outputs the answer as a double.

b) Write a program that inputs an integer n, a number m, iterates
through the Babylonian algorithm m times, and ouotputs the answer.

c) Write a program that inputs an integer n, a double e, and iterates
through the Babylonian algorithm until the difference between two
succesive guesses is less than e.