assume that three jobs arrive at approximately the same time (arrival time are all 0), but job a arrives slightly before job b, and job b arrives slightly before job c (if the jobs must be selected in order, the order should be a->b->c). job a requires 3 sec of cpu, job b is 5 secs, and job c is 4 secs. assume a time-slice of 1 second.