Consider the following set of processes with arrival times and length of CPU burst times given in milliseconds: Process B D E Arrival time 3 5 5 6 9 Burst time 5 6 3 7 2 Calculate the turn around time for the following listed below CPU scheduling algorithm. In case of ambiguity between B and C, schedule the shorter of the two first. In case of equivalent remaining times, schedule the earliest arrival first. (Show all of your work to obtain partial credit) (a) FCFS (First-Come-First-Served)