Illustrate the CPU schedule using the following policies: i. CPU scheduler has three internal queues (Q1, Q2 and Q3), where Q1 uses preemptive shortest job first, Q2 uses Round Robin with quantum 3 and Q3 uses First Come First Served. Assume all process first arrive on Q1 (the higher priority queue) and aged thereafter based on performance. ii. CPU scheduler has two queues; (1) interactive (user) processes and (2) system processes. Jobs on system ready queue automatically have priority over jobs in the user ready queue, and the user jobs will be pre-empted to run system jobs. The system queve run on preemptive priority, while user queue runs on a round robin basis, each job in the user ready queue getting three time slices at a time. iii. Preemptive Priority. 15. Which type of process is generally favoured by a multilevel feedback queueing scheduler-a processor-bound process or an I/O-bound process? Briefly explain why. 16. Explain how to fool the multi-level feedback scheduler's heuristics into giving a long-running task more CPU cycles