Java

Chapter 3 Exercise 1 Babylonian Algorithm. The Babylonian algorithm to compute the square root of a positive number n is as follows: 1. Make a guess at the answer (you can pick n/2 as your initial guess). 2. Computer -n guess. 3. Set ouess - (guess +r) / 2. 4. Go back to step 2 until the last two guess values are within 1% of each other. wita proam that puts an integer for n, terates through the Babylonian algorithm until the guess is within 1% of the previous guess, and outputs the answer as a double to two decal place uanswer 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 eads in the integer DUTPUL Each time a new guess is computed, the program prints the line "Current guess: 9", where is the current guess, printed out with no special formatting. The final output is "The estimated quare root of x y where 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 toal of sex characters. LASS NAMES. Your program dass should be called Babylonia