In this project you will be creating several methods to do a variety of things. Be careful to implement exactly what the method is asking for. Be sure to follow these rules (or lose points): 1. You must implement all of these methods in a single class called Project3
2. You must name your methods exactly as they are written below. Do not change the method name or modify the capitalization.
3. Do not add, remove, or reorder parameters or change the types. (Match examples given.)
4. Do not change the return type. a. Note: Returning is not the same as printing. The method should only print something if the instructions say so. Otherwise, the method should return the result and should not print anything. (You can and should print as you code and debug, but remove print statements that should not be there prior to submission.)
5. Each method may have at most one return statement (or none if it is void and does not return anything). You will lose points if you have a method with multiple return statements.
6. For the methods that work with Strings, you are only allowed to use charAt, substring, indexOf, length, equals and/or compareTo. If you want to use any other built-in method, you must ask me first (and I may say no--some methods may exist that make the task trivial. You will not be allowed to use these). To be clear, you are not allowed to use any replace or replaceAll String methods.
7. Do not duplicate code in this project. Make use of methods that you write if they can be used elsewhere in the project. If you have any questions about what the method is asking for, just ask.

Which of the following are types of formatting you can apply to a spreadsheet? choose all that apply.

Which of the following is true of operations within a spreadsheet program’s built-in functions? a. operations within parentheses, then multiplication and division, and then addition and subtraction are computed. b. operations within parentheses, then addition and subtraction, and then multiplication and division are computed. c. multiplication and division, then addition and subtraction, and then operations within parentheses are computed. d. addition and subtraction, then multiplication and division, and then operations within parentheses are computed

1. package newton’s method for approximating square roots (case study 3.6) in a function named newton. this function expects the input number as an argument and returns the estimate of its square root. the script should also include a main function that allows the user to compute square roots of inputs until she presses the enter/return key. 2. convert newton’s method for approximating square roots in project 1 to a recursive function named newton. (hint: the estimate of the square root should be passed as a second argument to the function.) 3. elena complains that the recursive newton function in project 2 includes an extra argument for the estimate. the function’s users should not have to provide this value, which is always the same, when they call this function. modify the definition of the function so that it uses a keyword parameter with the appropriate default value for this argument, and call the function without a second argument to demonstrate that it solves this problem. 4. restructure newton’s method (case study 3.6) by decomposing it into three cooperating functions. the newton function can use either the recursive strategy of project 1 or the iterative strategy of case study 3.6. the task of testing for the limit is assigned to a function named limitreached, whereas the task of computing a new approximation is assigned to a function named improveestimate. each function expects the relevant arguments and returns an appropriate value. 5. a list is sorted in ascending order if it is empty or each item except the last one is less than or equal to its successor. define a predicate issorted that expects a list as an argument and returns true if the list is sorted, or returns false otherwise. (hint: for a list of length 2 or greater, loop through the list and compare pairs of items, from left to right, and return false if the first item in a pair is greater.)