2. Suppose that we have a multiprogrammed computer with a single CPU (a single core) in which each job has identical characteristics. In one period T for a job, the first half of T is spent on computing in CPU, and the second half is spent in 1/0. Each job runs for a total of N periods. Assume that we have simple time-sharing that executes the computation parts of jobs in turns (i.e., round-robin order) with no preemption (i.e., run the computation of a job until it accesses 1/0). Also, assume that I/O operations can overlap with the computation in CPU. Define the following quantities: Turnaround time = finish time of a job - start time of a job (finish time the time point when this job completes all its computation and I/O; start time -- the time point when this job first starts its execution in CPU or 1/0) Throughput average number of jobs completed per time period T Processor utilization = percentage of the time that the CPU is busy working on some computation (i.e., not idling, not waiting for 1/0) Compute the above three quantities for one, two, and four jobs that all arrive at the same time, and fill in the following table. Hint: Your calculation should use N and T. Number of jobs Turnaround time Throughput Processor utilization 2