Question: Babylonian Algorithm. The Babylonian algorithm to compute the square root of a positive number n is as given:
Step 1: Make a guess at the answer (you can pick n/2 as your initial guess).
Step 2: Computer = n / guess.
Step 3: Set guess = (guess +r) / 2.
Step 4: Go back to step 2 until the last two guess values are within 1% of each other.
Program: Write a program that inputs an integer for n, iterates through the Babylonian algorithm until the guess is within 1% of the previous guess, and outputs the answer as a double to two decimal places.
Your answer should be accurate even for large values of n. INPUT and PROMPTS. The program prints "This program estimates square roots." and then prompts for a positive integer as follows: ("Enter an integer to estimate the square root of: " and then reads in the integer . OUTPUT .
Each time a new guess is computed, the program prints it he line "Current guess: g", where g is the current guess, printed out with no special formatting. The final output is "The estimated square root of x is y", where x is the integer that was read in and y is the value computed by the procedure described above, printed out to two decimal places and a total of six characters . CLASS NAMES. Your program class should be called Babylonia
The solution must be error free and compile correctly on first attempt. Any code that does not do this will not be awarded points.