3. Scheduling algorithms play an important role in helping achieve a computer systems design objectives. consider 4 jobs A through D, arrive at the ready queue of the operating system. All these jobs are CPU bound. They have estimated running times of 10, 1, 2 and 5 minutes. respectively. Their (externally determined) priorities are 3, 5, 3, and 1, respectively, with 5 being the highest priority. Answer the questions below.

(a) Explain concisely in one or two sentences the following 2 scheduling criteria,
i. Throughput
ii. Response time
(b) Compute the above 2 scheduling criteria (or metrics) for any two of the following scheduling algorithms
i. Round robin (using scheduling quantum as 1 minute)
ii. Priority scheduling
iii. First-come, first-served (run in order A -D)
iv. Shortest job first