Using the same information from Exercise II$,$ calculate which jobs will have arrived ready for processing by the time the first job is finished or interrupted using each of the following scheduling algorithms.

$1.$ FCFS

$2.$SJN

$3.$ SRT

$4.$ Round robin $($using a time quantum of $5,$ ignore context switching and natural wait$)$