What is Heron’s algorithm for finding the square root of a number?

Given that Heron’s algorithm always overestimates the square root, explain howHeron’s algorithm can be adapted into a decision algorithm for the perfect squareproblem

Based on the Heron-adapted algorithm, what is the complexity class of theperfect square problem? Show your reasoning.

Mary is working to find the square root of a number in C++ language using a binary search algorithm. Which of the following options can she perform to get an optimized solution?Constraints0<=x<=2^31-1Optionsint fun(int x) { if(x==1) return x; int low=0,high=x; int res=0; while(low<high){ int mid=(low+high)/2; if(mid>x/mid) high=mid; else{ res=mid; low=mid+1; } } return res;}int fun(int x) { if(x==1) return x; int low=0,high=x; int res=0; while(low<=high){ int mid=low+(high-low)/2; if(mid>x/(mid*mid) high=mid; else{ res=mid; low=mid+1; } } return res;}int fun(int x) { if(x==1) return x; int low=0,high=x; int res=0; while(low<high){ int mid=low+(high-low)/2; else if((mid*mid*mid)>x) high=mid; else{ res=mid; low=mid+1; } } return res;}int fun(int x) { int res=0; for(int i=0;i<=x;i++){ if((i*i)<=x) res=i; } return res;}

Heron's Formula is used to find the area of SAS triangles.Group of answer choicesTrueFalse PreviousNext

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.