2. Here's some pseudocode that shows a way to calculate the non-negative square root of a non-negative number, n, using an algorithm called the Babylonian method repeat x(x + n / x) 2.0 until p-x At the end of this process, x will be our approximation of the square root of n Create a Python 3 function that implements the above pseudocode and returns the resulting square root of some non-negative number of type float