2. The basic algorithms for CPU scheduling include First Come First Serve, Shortest Job First, Priority Scheduling, and Round Robin. In addition, two more complicated scheduling algorithms are Multi-Level Queues and Multi-Level Feedback Queues. (11%) (a) Which basic scheduling algorithm should we select if the average response time of a process is the major concern? (4%) (b) Which basic scheduling algorithm is usually selected for scheduling a queue of CPU-bound processes within Multi-Level Queues? (3%) (c) Among the six scheduling algorithms, which is able to distinguish between I/O-bound and CPU-bound processes? (4%)