You should generate one Java smooth for each total and catch them all in one folder. Compress the folder as a .zip smooth and acquiesce it short. Please spectry your .zip smooth as P5-Last Name-First Nam.zip. For stance, P5-Smith-John.zip. A Account instrument containing the algorithms and the screenshots of the ordinary programs for all of the five totals. Please spectry your Account instrument as P5-Last Name-First Name.docx or .doc. For stance, P5-Smith-John.docx. Consider the subjoined totals, contrivance the algorithms that would explain them, and then instrument the algorithm in Java. Problem 1: Write a program that reads a set of floating-aim values. Ask the user to penetrate the values, then sculpture: The mean of the values The meanest of the values The largest of the values The order, that is the dissent betwixt the meanest and the largest Of manner, you may simply apt for the values once. Problem 2: Write a program that reads a account and sculptures each class of the account on a disunited cord. For stance, if the user provides the input "Harry", the program sculptures: H a r r y Problem 3: The Fibonacci collection are defined by the sequence: f1 = 1 f2 = 1 fn = fn-1 + fn-2. Reformulate that as Fold1 = 1; Fold2=1; Fnew=fold1+fold2; After that, disregard fold2, which is no longer insufficiencyed, and set fold2 to fold1, and fold1 to fnew. Repeat an withhold sum of times. Implement a program that apts the user for an integer n and sculptures the nth Fibonacci sum, using the aggravate algorithm. Problem 4: Write a program that sculptures a reproduction board, love this: 1 2 3 4 5 6 7 8 9 10 2 4 6 8 10 12 14 16 18 20 3 6 9 12 15 18 21 24 27 30 … 10 20 30 40 50 60 70 80 90 100 Problem 5: This total is the Total 4 in Module 2 for the algorithm plan. Now you already bear the algorithm and you can representation it short. You stationary insufficiency to transcribe the commencement rule and obtain?} a screenshot of the ordinary program.  Imagine yourself in the intermediate of Manhattan, wshort the streets are upright on avenues. You are in a grid of streets, partially past, and you randomly gather one of indelicate directions and tread to the present intersection. Not experienced wshort you truly insufficiency to go, you repeatedly randomly gather one of the indelicate directions, and so on. After repeating the corresponding move for a sum of times, you may insufficiency to recognize how far you got from the former aim. Represent colonys as integer pairs(x,y). Generate an algorithm that instruments your move through New York City, aggravate 100 intersections, starting at (0,0) and sculpture the effect colony, portico into consequence that each move, from one intersection to another procure be one mile. Submission: You are required to acquiesce the subjoined smooths for this assignment by clicking the Acquiesce Assignment nothing aggravate.