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

1. Make a guess at the answer (you can pick n/2 as your initial guess)

2. compute r= n/guess

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

4. Go Back to step 2 for as many iterations as necessary. The more that steps 2 and 3 are repeated, the closer guess will become to the square root of n

Write a program that inputs a double for n and iterates through the Babylonian algorithm 100 times. For a more challenging version, iterate until guess is within 1% of the previous guess and outputs the answer as a double.

Can i please get above program in C++