data structure and algorithms full solution and very fast please

An Automatic Scheduling Appointments System for Medical Services in a Hospital, works as follows: When the first patient comes to the Hospital, the machine interface provides all the available specialized medical clinics as follows 1. Cardiology 2. Endocrinology 3. Neurology 4. Pediatrics 3. Oral and dental health 6- Ophthalmology The patient is to be ask to write his/her name and to enter the number of the selected medical clinic. A randomly generated number between 1000 and 5000 called queueorder is generated and assigned to the patient and a printed paper of this number provided to the patient as his/her position in the queue. At that time, the patient asked to wait in the queue. For each newly arrived patient, the position of the previous patient (queuecorder number) is to be added by one unit and it is saved along with the name of the patient and the number reflects the selected medical clinic. Then the patient waits in the queue. This process repeats until 12 patients are in the queue. Write a C program that uses the queue and patient structure given below to simulate the Scheduling Appointments System explained above. Your program bould start by adding 12 patients to the queue. Then the patient will receive the treatment and they will leave the queue one by one Each time a patient leaves the queue bisher name and the corresponding queucorder number must be shown on the screen. Giving treatment to the patients is based on FIFO strategy struct queue Node! patients struct queue Node "nextpir: Struer patient ! Charname [20] int clinic Num. int pos! gouro 4