Use the Pseudocode Summary Chart (attached below), to help you with the pseudocode needed to write the following algorithm solutions. (The chart is the same handout that was posted in the Week 2 folder and basically corresponds to Fig 2.9 on page 59 in Chapter 2 of the Invitation to Comp. Sci. textbook).

Design the following algorithms (using Pseudocode):

1. Write an algorithm that determines the flying time between two cities given the mileage between them and the speed of the airplane. (Hint: use the formula distance = rate x time to help you devise a solution. ) (10 pts )

2. Compute and display the value of X divided by Y if the value of Y is not zero. If Y does have the value 0 then display a message

saying, Unable to perform the division. (10 pts)

3. Write an algorithm, that given a numeric grade outputs the corresponding letter grade (A, B, C, D, or F) corresponding to the grading scale in your syllabus. (20 pts.)

4. Write an algorithm that inputs four assignment scores corresponding to scores received on a 3-semester discussion and homework assignment. Your algorithm should compute and display the average of all four assignments weighing the homework assignment twice as heavily as a regular discussion assignment. (20 pts.)

5. Modify the discussion averaging algorithm you wrote in problem 4 above so that it reads in a total of 14 regular discussion scores plus a homework score, which counts twice as much as a regular discussion. Use a loop to input and sum the scores. (20 pts.) (HINT: Be sure to examine problems 3 and 4 in the Professor's Practice Problems (with Solutions) document posted on the Week 2 & 3 Instructions page.)

6. Write an algorithm that adds up a sequence of twenty numbers and outputs the sum of the numbers as well as the average of the numbers. (Your algorithm MUST use a loop to read in and process the input) (20 pts.) (HINT: Be sure to examine problems 3 and 4 in the Professor's Practice Problems (with Solutions) document posted on the Week 2 & 3 Instructions page.)