1. Given the arrival and service times for Processes A-C depicted below Process Arrival Time Service Time 2 a. Fill out the chart below to depict the schedule as implemented by two scheduling algorithms: (1) round robin with a time-slice of one unit, and (2) round robin with a time-slice of three units. Assume that newly-arrived processes always enter at the end of the wait queue, but that a process transitioning from running to waiting is then added after the newly arrived process. Among other characteristics, a correct solution will have one block labeled per vertical column (per scheduling algorithm). The first column for the Round Robin (q=1) algorithm has been completed for you in the top left position Round robin, q- 1 units A Round robin, 4 - 3 units 10 time (each vertical datted line represents one unit) b. Calculate the turn-around time to the table below for each process Round robin (q- 1 units Process Turn-around Time Round robin (q=3 units) Process Turn-around Time