The babylonian algorithm to compute the square root of a positive number make a guess at the answer (you can pick n/2 as your initial guess). compute r = n / guess . set guess = (guess + r) / 2 . go back to step 2 for as many iterations as necessary. the more 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 , iterates through the babylonian algorithm five times, and outputs the answer as a double to two decimal places