Suppose that we have a multiprogrammed computer in which each job has identicalcharacteristics. In one computation period, T, for a job, half the time is spent in I/Oand the other half in processor activity. Each job runs for a total of Nperiods. Assumethat a simple round-robin priority is used, and that I/O operations can overlap withprocessor operation. Define the following quantities:⢠Turnaround time to complete a job⢠number of jobs completed per time period T⢠Processor of time that the processor is active (not waiting)Compute these quantities for one, two, and four simultaneous