In this problem, you will write a function that approximates a square root and returns the result. The function takes two arguments. The first argument, n, represents the number we want to approximate the square root of, and the second number represents the number of iterations to perform. (Recall that when we wrote pseudocode for this function in class, we performed 20 iterations.) If the iteration given is 0, then use the original guess of n as your approximation. You may not use library functions such as math::sqrt for this question. Your function should return the approximate square root as a string of the number rounded to five decimal places. A function that takes in a floating point number and returns a string of that number rounded to a specific decimal point precision has been provided for you in the starter code. As a quick reminder, the square root of x, written x, is the number that when raised to the power of 2 gives x. You will be using the concept of binary search to approximate finding the square root. In C++