/** * Computes estimate of square root of x to within relative error 0.01%. *  * @param x *            positive number to compute square root of * @return estimate of square root */private static double sqrt(double x) {    ...}

Using perfect squares, estimate the square root of .

Suppose that you are estimating √7 using the second Taylor polynomial for √x at x=6 . Use Taylor's Theorem for Remainders to bound the error.Round your answer to six decimal places.Provide your answer below:

Given a non-negative integer x, return the square root of x rounded down to the nearest integer. The returned integer should be non-negative as well.You must not use any built-in exponent function or operator.For example, do not use pow(x, 0.5) in c++ or x ** 0.5 in python. Example 1:Input: x = 4Output: 2Explanation: The square root of 4 is 2, so we return 2.Example 2:Input: x = 8Output: 2Explanation: The square root of 8 is 2.82842..., and since we round it down to the nearest integer, 2 is returned.

Change sqrt (including its Javadoc comments) so it also works when x = 0. Note: if your code from Newton1 appears to work without any changes, but it is such that it might execute a division by 0, then it is not correct. Division by 0, in general, is undefined and you should not write code that attempts to compute it.

ERROR ANALYSIS  Describe and correct the error in writing $\sqrt{72}$√72​ in simplest form.X$\sqrt{72}=\sqrt{4\cdot18}$√72=√4·18​          $=\sqrt{4}\cdot\sqrt{18}$=√4·√18​          $=2\sqrt{18}$