Consider a system with five processes. All five processes start executing at the same time (time 0). The first process will run for 5 seconds; the second, 8 seconds; the third, 4 seconds; the fourth, 10 seconds; and the fifth, 2 seconds. Create a log showing time (start with time, t0) and each state transition (e.g., P2: New to Ready) as the system executes the 5 processes using a first-come-first-serve scheduling algorithm. Repeat the exercise for the round robin (assume a quantum time of 2 seconds) and shortest job first scheduling algorithms.