C program to solve the following problem:que 14:   Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4999. The drive is currently serving a request at cylinder143, and the previous request was at cylinder 125. The queue of pending requests, in FIFO order, is:   86, 1470, 913, 1774, 948, 1509, 1022, 1750, 130   Starting from the current head position, what is the total distance (in cylinders)that the disk arm moves to satisfy all the pending requests for each of the SCAN disk-scheduling algorithms///// que11: The problem is to minimize the waiting time of students in the queue. It is done by using multilevel priority queue scheduling. Two queues are made for teachers (Q1) and students (Q2) respectively where priority of teacher is greater than student (Q1 > Q2). The user has to prompt the value of time taken by the candidate and whether the candidate is a teacher or student.