Using the same information from the previous exercise, calculate the start time and finish time for each of the five jobs using each of the following scheduling algorithms $($ignoring context switching overhead times$).$

a$.$ FCFS

b$.$ SJN

c$.$ SRT

d$.$ Round robin $($using a time quantum of $5)$

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