Assume the following processes with associated times and priorities. Using non-preemptive scheduling, compute the wait time for these processes, using FCFS, SJF, priority-based, and round robin (quantum = 2) algorithms.
Process Arrival Time Burst (execute) Time
P1 0.0 8
P2 0.4 4
p3 1.0 1
Be sure to show your work (details of how you arrived at the answer).