Problem
The following method was known to the ancient Greeks for computing square roots. Given a value x > 0 and a guess g for the square root, a better guess is (x + g/x) / 2. Write a recursive helper method public static square Root Guess(double x, double g). If g2 is approximately equal to x, return g, otherwise, return square Root Guess with the better guess. Then write a method public static square Root(double x) that uses the helper method.