This is a program which simulates management of students in a university, along with the courses for which they are registering for the upcoming semester. Since each student in the university takes a different number of courses, we will be using a linked list to store each student's class schedule. The whole student body will be stored as an array of structs, where each struct in the array represents the student ID and a linked list containing the classes for which they have registered.

Select Student By ID

When the user chooses this option, the program should ask the user to enter a student ID$.$ After doing so$,$ the program should search the array to see if the student ID can be found. This feature MUST be done using the binary search recursive algorithm.

If the student ID is found then the program should display the message: Student selected The program should use this selected student for all other menu options until a different student is selected. Make sure to store the array position of the selected student so you don't have to search the array each time an operation is performed.If the student ID cannot be found, then the program should display the message: Student ID not found. In this case, the other menu options $($except exit$)$ won't be able to work.

Enter student ID: A

Student ID not found