We've come up with a new process scheduler for an interactive multitasking operating system. Intended for desktop computers running at about 8 million instructions per second (7 MIPS), the scheduler is based on a single-queue preemptive round-robin scheme with a quantum of 2 microseconds (1/2,000,000 of a second). Discuss the performance of this scheduler, especially with respect to eciency and response time