A. Assume the following schedule for a set for three process A, B, and C A runs first (for 4 time units) but is not yet done B runs next (for 4 time units) but is not yet done C runs next (for 7 time units) and runs to completion B runs to completion (in 8 time units) A runs to completion (in 14 time units) Which of the following schedulers can produce the above schedule. Answer yes or no 1. FIFO 2. STCF 3. Round Robin (RR)- 4. Multi-level Feedback Queue (MLFQ) 5. Lottery