HW1 (Graded out of 100) Write a program that manages students' information. Each student's information consists of a netID and a GPA, maintained in parallel arrays. The program will loop on displaying the following menu of choices: 1. List the top n students 2. Search for a student 3. Exit the program. If the user chooses 1, the user will be prompted for the value of n, and the netID and GPA of the top n students will be listed, starting with the student with highest GPA and going down. If the user chooses 2, user will be prompted to enter the student's netlD. If the netlD is found in the netlD array, the array index and the GPA of the student are displayed. If the student is not found, a "Student not found" message is displayed