9. Using the same information from the previous exercise, calculate the start time and finish time for each of the five jobs using each of the following scheduling algorithms. a. FCFS b. SJN c. SRT d. Round robin (using a time quantum of 5, but ignore the time required for context switching and natural wait) Job Arrival Time CPU Cycle A o 15 B 2 2 3 14 D 6 10 E 10 2 10. Using the same information from the previous exercise, calculate the start time and finish time for each of the five jobs using each of the following scheduling algorithms (ignoring context switching overhead times). a. FCFS b. SJN c. SRT d. Round robin (using a time quantum of 5) Job Arrival Time CPU Cycle A o 15 B 2 2 3 14 D 6 10 E 10 2