Given the following information:

$\backslash$table$[[$Job$,$Arrival Time,CPU Cycle$],[$A$,0,12],[$B$,2,2],[$C$,3,10],[$D$,6,7],[$E$,10,3]]$

Calculate which jobs will have arrived ready for processing by the time the first job is finished or is first interrupted. Do your calculation 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$)$ Complete these tables with the answers.