Use C and linked lists to create a circular queue that allows you to store the name of a student and her/his ID for the students that are enrolled in a math class. The data fields in each node consist of

First Name: String, size 10 char

Last Name: String, size 10 char

Student ID: String, size 10 char

The size of the queue is limited to 10 nodes. Make sure your implementation is circular, so students can be added and deleted within the limits of the maximum size of the queue. Implement the following operations on your queue. The user should be able to select any operation until quit is entered at the command prompt.

1) Add a new student to the course

2) Delete a student from the course by student ID

3) Search for a student by first name, last name or student ID