Five jobs arrive nearly simultaneously for processing and their estimated CPU cycles are, respectively: Job $A=2ms,$ Job $B=12ms,$ JobC$=15ms,$ Job $D=7ms,$ and Job $E=3ms.$

a$.$ Using FCFS$,$ in what order would they be processed? What is the total time required to process all five jobs? What is the average turnaround time for each of these five jobs?

b$.$ Using SIN, and assuming that all jobs are present when the algorithm begins, in what order would they be processed? What is the total time required to process all five jobs? What is the average turnaround time for all five jobs?

c$.$ Using SJN$,$ and assuming that all jobs are present when the algorithm begins, what is the average tumaround time for all five jobs using these speeds: Job A $=12ms,$ JobB$=2ms,$ JobC$=15ms,$ JobD$=7ms$ and JobF$=3ms$