**Write In JAVA Please!!**

2. Write a program to apply the Modified Newton's Method Tn-1 to the equation ()3r2 +4 0 starting with o 3. Use m and 2 and make separate numerical runs. In each case, set the maximum number of iterations to 25, but stop the computation when the backward error, i.e. f(n), is less than 10-12, Print all intermediate points xn and backward errors f(xn). Verify the convergence rates of your numerical solutions in both cases. (For m 1, you should observe linear convergence. For m-2, you should get quadratic convergence.) Use double precision in your computation. 15 points)