I need the code in c++ please help i am learning c++ with the book Starting Out With C++, From Control Structures through Objects, Ninth Edition, by Tony Gaddis, Addison Wesley, 2018

Source Code Cs cs1 337-U16-HW1.par Mail-H1613304u tex 1337-u 18-cu?2-1 1337-L 18-Quiz 1 xGCheggsu d Guided New Tat / \ x x Secure https://elearning.uidallas.edubbcswebdav/pid-1969/61-dt-content-rid-48296219 1/courses/2185-merged-CE133/0U2-CS133/0U2/CS1331-U18-HW1.pdf CS1337 Homework #1 Assigned May 29, due Jun 5 at 11:59 PM This homework assignment gives you the opportunity to practice sorting/searching and parallel arrays 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 netID. If the netID is found in the netID 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 Additional Requirements - Make sure you comply with all the requirements to avoid losing points 1. 4:11 PM Source Code Cs cs1 337-U16-HW1.par Mail-H1613304u tex 1337-u 18-cu?2-1 1337-L 18-Quiz 1 xGCheggsu d Guided New Tat / \ x x Secure https://elearning.uidallas.edubbcswebdav/pid-1969/61-dt-content-rid-48296219 1/courses/2185-merged-CE133/0U2-CS133/0U2/CS1331-U18-HW1.pdf CS1337 Homework #1 Assigned May 29, due Jun 5 at 11:59 PM This homework assignment gives you the opportunity to practice sorting/searching and parallel arrays 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 netID. If the netID is found in the netID 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 Additional Requirements - Make sure you comply with all the requirements to avoid losing points 1. 4:11 PM