In Java

D) Write a program with a static method that computes square roots using the Babylonian method https/len.wikipedia.oro/wikiMethods of computing square roots#Babylonian method It is an iterative method that keeps making better and better approximations to the square root of a number. The algorithm is terminated when the improvement in successive approximations becomes small. Our version of the Babylonian method to find the square root of a number N is as follows: 1.Let MI:# N/2 be our first guess Let M2: average of M1 and N/M1 3. If IM1-M2|