Assume you have the following jobs to execute with one processor: give the average wait time for this set of processes using the following algorithms. specify the arbitration rule used for each algorithm, if needed. (a) first in first out (b) shortest job next (non-preemptive) (c) shortest remaining time next (pre-emptive) (d) round robin, with a quantum of 7 (e) round robin, with a quantum of 5 plus context switch time of 1