c++ help!

2. The Babylonian algorithm to compute the square root ofa number n is as follows: 1. Make a quess at the answer (vou can pick n/2 as vour initial guess). 2. Compute r n/guess 3. Set guess 4. Go back to step 2 for as many iterations as necessary. The more that step:s 2 and 3 are repeated, the closer guess will become to the square root of n. -(guess tr)/2 Write a program that inputs an integer for n, iterates through the Babylonian algorithm five times, and outputs the answer as a double to two decimal places. Your answer will be most accurate for small values of n