(Data Structures) Using C++, please the following:

A school needs to maintain student records. The school consist of 12 classes (from class1 to class 12), each class may have many sections (4 sections only). The student object consists of student Name, ID, section # and the GPA. The following notes should be taken

• The school represented as a hash table of 12 pointers, each one of them points to a dynamic array of lists of student objects

(list * school [13]; use only the indices between 1 and 12. Dont use the index 0. Initialize each one by NULL. Each array index represents the class#.

For example: school [3] means the list of all students in the class# 3

Note that the class # should be returned from the hash function. The hash function should generate it from the student ID.

• The student in class #1 has no GPA
• Use the following menu

1. Enter a student record.

2. List all student records in a specific class

3. Search about student using the ID

4. Rearrange the student in a specific class by the section (i.e. students in section A comes before students in section B).

5. Find the brilliant student (Max GPA) in the school.

6. Print the students in the specific class alphabetically ordered.

7. Print the failed student in the class.

8. fill method to fill random n students with random information.

9. Exit program.

O Unused 1 "Ali", 201967,'D',0.0 "Jaber", 201905,'A',0.0 ! 2 3 4 5 "Ali", 20189,'B',75.0 "Said", 20159,'C',66.4 "Soso", 20019,'F',45.3 6 7 8 8 9 10 11 12