Dont even know where to start.

Project: Compute Roots Using Newton Iteration Objectives 1. Hxposare to usimg double variables, while loops, and static methods 2. Exposure to using several Felipee features including creating a project by copying an existing project, renaming a Java file using refactoriage deleting files, efeating a file by) copying an existing file, using the Java editor, and exporting a project The Problem Your first job is to create a Java pogram that repeatedly asks the aser whether they wish to calculate a square root. Each time, if the response is " y ", then the program choald proceed; if it is anything else, then the program should quiL. Wbenever it proceedr, the progran should prempt the user for a number (a positive dewble, and your program may simply assume the iaput The intritive idea of Newton itention for computing sguare roots is fairly straightforward. Suppose you have a guess r for x/2 that is too large; the argument is similar if it is too small. If ris too large to be the square root of x, then x/r must be too small, so the average of r and xr should be a beiter guess than either r of or. This suggests that if you repeatedly replace your current goess r by (r+x/r)/2, then your sequence of guesses should converge to x1/2. And indoed it ean be proved that it does. A good initial guess for x1/ is simply r. x. If you conninue updating r until r22x/x