Please Only Answer F.

Consider the following set of five processes where arrival is the time the process became ready, t is the total service time, and e is the external priority. Assume that execution starts immediately at time 0 and there is no context switch overhead. For the following scheduling disciplines, draw a time diagram showing when each of the five processes executes. (In the case of a tie, assume that the process with the lower process number executes first.) Calculate the average waiting time for each of the scheduling disciplines. a) FIFO b) SJF c) SRT d) RR (quantum = 10) e) LRT (Largest Remaining Time) (if there was such a method !) f) ML (using FIFO at each priority level)