To set up our conversation about Linear-Time Sorting, we discussed that comparison-based sorting algorithms can be modeled as a decision tree. While this is a theoretical model, it also has at least some practical use; if you can draw a decision tree representing an algorithm that sorts a finite (and presumably small) set of numbers, you can translate if by hand into C++ code using nested if statements. Each non-leaf node would translate into an if statement, with its children becoming the if and else branches of that statement, respectively, while each leaf node would translate into a final conclusion on the sorted order of the elements (e. g., a reordering of the elements or a return statement of some kind). Now suppose that you used a decision tree to sort exactly four elements and then hand-translated it to C++ code, using the technique described above. At minimum, how many if statements would you expect to find in your translated code.

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