$1.$ Assume six processes A$,$ B$,$ C$,$ D$,$ E$,$ and F arrived in given times, with the following CPU time & priority values $($smaller values $=$ higher priority$)$

Process CPU Arrival Priority

A $333$

B $1001$

C $782$

D $242$

E $3101$

F $2124$

a$.(50\%)$ Show the execution order of the processes using preemptive SJF$,$ priority, and Round Robin with a time quantum of $3$ and $8,$ and FCFS ignoring context switching overhead $($there are $5$ algorithms, so show the schedules for all $5)$ and $(50\%)$ Calculate and show the average waiting time, turnaround time for each process, and throughput for each method above.