Describing algorithm: in some problems you may be asked to describe an algorithm. your descript should be in the form of a short essay. the essay should include the following: a description of the algorithm in pseudo code how your algorithm works? demonstrate your algorithm using one worked example or diagram a proof (or indication) of the correctness of the algorithm an analysis of the running time of the algorithm given n files fl, f3 of length ml, , the optimal tape-storage problem is to find which order is the best to store them on a tape to get minimum cost of total retrieval time, assuming that each retrieval starts with the tape rewound, each retrieval takes time equal to the length of the preceding files in the tape plus the length of the retrieval file, and that files are to be retrieved in reverse order. the greedy algorithm put the files on the tape in ascending order of size. prove that this is the best order.

Write a grading program for a class with the following grading policies: a. there are two quizzes, each graded on the basis of 10 points. b. there is one midterm exam and one final exam, each graded on the basis of 100 points. c. the final exam counts for 50% of the grade, the midterm counts for 25%, and the two quizzes together count for a total of 25%. (do not forget to normalize the quiz scores. they should be converted to a percentage before they are averaged in.) any grade of 90 or more is an a, any grade of 80 or more (but less than 90) is a b, any grade of 70 or more (but less than 80) is a c, any grade of 60 or more (but less than 70) is a d, and any grade below 60 is an f. the program will read in the student’s scores and output the student’s record, which consists of two quiz and two exam scores as well as the student’s average numeric score for the entire course and final letter grade. define and use a structure for the student reco