Use C++ Please

Problem: There is a Babylonian Method for calculating a square root of a number. In this method you have the number for which you want to find the square root and an original guess. Then you continue to calculate new guesses using the formula newGuess -(lastGuess + (n/lastGuess))/2 where n is the number for which you are calculated the square root and lastGuess is the previous guess. The calculation of new guesses continues until difference between guesses is less than a specified value. A template with the Babylonian Method implemented with a recursive function is posted on Canvas. Download and review this template. Add a new function that uses repetition rather than recursion to calculate the square root using the Babylonian method. (Remember to write comments for your function prior to writing any code for your function). Call this new function from main and output the result of this new function within main. Remember to write your function definition after main and write a function declaration (prototype) before main for your function. Write comments immediately before your new function describing the task of the function, input, output, and processing for the second function. Do not use the same variable name in multiple (more than one) functions