Course Gradebook System

The assignment requires the creation of a program that calculates final grades for students based on their exam scores. The program will ask the user to input information about 10 students, including their first name, last name, student ID, and four exam grades. The program will then calculate each student's final grade and determine whether they passed or failed. Additionally, it will identify the student with the highest overall score.

Final Program (300 pts): Course Gradebook
Program flow:
1. Input data
2. Check/validate data
3. Calculate final grade
4. Output data
Requirements:
1. The number of students to enter will be 10.
2. Using a struct, you will keep track of a student's:
a. first name
b. last name
c. student ID
d. 4 exam grades (each out of 100 points)
e. final letter grade.
3. For each student, if the user enters invalid data he will be allowed to enter it again.
4. Steps 3 and 4 of the Program Flow cannot execute if your data checking detected an error.
5. Letter grade calculation will use the standard grading scale.
a. 90% - 100% = A
b. 80% - 89% = B
c. 70% - 79% = C
d. 60% - 69% = D
e. Below 60% = F
6. The output will consist of:
a. A list of students who passed (C or higher)
b. A list of students who did not pass (D or lower)
c. The person(s) with the highest grade (points, not letter)
Restrictions:
1. main() will only consist of variable declarations, functions, and small amounts of logic, if necessary. The
majority of the logic will reside in the core functions.
2. In the student struct, the exam grades must be stored as an array, not 4 separate variables.
3. For Program Flow 2: use a function
4. For Requirement 3: use a try/catch and a loop
Example output
-------------
PASS
----
Aberdeen, Joe A
Blake, Kevin A
Garry, Glen C
Jenakovski, Mary B
FAIL
----
Zoolander, Derek F
HIGHEST GRADE
----
Blake, Kevin A

Extra Credit:
1. Allow the user to specify the number of students to be entered
2. Allow spaces in the first or last name
3. Protect against bad data, in addition to that which is required in Requirement 3
4. Use a recursive function for Requirement 6c