Process Scheduling Question =========================== An operating system is coordinating three user processes: A, B and C. Process A requires 900 time units to complete, process B requires 700 time units to complete and process C requires 700 time units to complete. Assuming that the scheduler implements the shortest job first algorithm, at what relative time in the future do process A, B, C complete. Also what is the real average completion time for each process. You must answer this question by using a strict format which must follow: processA: #### processB: #### processC: #### averageT: #### Suppose the operating system scheduler were to be rewritten to use a round robin algorithm with a time quanta of 100 time units. At what relative time in the future do process A, B, C complete and what is the real average completion time for each process? Again you must use the same format: processA: #### processB: #### processC: #### averageT: #### where #### is a number representing time units. When calculating averages, the final answer should be rounded down to the smallest whole number.