1. The Babylonian algorithm to compute the square root of a positive number num is as follows: 1. Make a guess at the answer (you may pick num/2 as your initial guess) 2. Compute div = num/ guess 3. Set guess = (guess + div) / 2 4. Go back to step 2 for as many iterations as necessary. The more step 2 and 3 are repeated, the closer guess will become to the square root of num. Implement this algorithm in a function named squareRoot that takes a positive number of type double as its argument and iterates through the Babylonian algorithm until the change of the guesses is within 1% of the previous guess