1.Explain the differences in the degree to which the followingscheduling algorithms discriminate in favour of shortprocessesa. FCFSb. RRc.Multilevel feedback queues1. First come first serve scheduling (FCFS).?In this algorithm the process that requires the CPU first is allotted theCPU first and its implementation can be easily maintained using FIFOqueue.?When a CPU is free, the process is allotted CPU and it will continueholding CPU fill it is terminated or requests I/O devices. So processwaiting for CPU will have to wait for its execution.?Thus waiting time is large if a larger process executes before a shorterprocess.?Thus we can say, FCFS discriminates against short job since any short jobarriving after long job will have a longer waiting time.2. Round robin scheduling.?This algorithm is designed for time sharing system.?A small unit of time called time quantum or time slice is defined and eachprocess is switched in and out of CPU depending on this time quantumvalue.?The time quantum is generally from 10 ms to 100 ms in length