Q$2$b$)$ Six processes A$,$ B$,$ C$,$ D$,$ E and F arrive in this order at the given time with the following CPU bursts. The process is immediately eligible for scheduling i$.$e$.$ if a process arrives at $1$ ms$,$ it can be scheduled at $1$ ms$.$Calculate the total turnaround time and total waiting time for SJF & Preemptive Priority scheduling policy $($Note: You do not have to calculate the average turnaround$/$waiting time$).$Proc. A B C D E F Cpu burst time. $473359$ Arrival time$($ms$)632340$ Priority $1$ is highest. $1322133$