1. Consider the execution of two processes P1 and P2, with the following CPU and I/O burst times. PI P2 CPU - 3 CPU - 4 Net - 4 Disk - 3 CPU - 2 CPU -3 Disk - 3 Net - 3 Each row shows the required...

Please help me with my review question on Operating Systems Subject. This is not a graded question, please also explain the reason why so that I could understand step by step.

Extracted text: 1. Consider the execution of two processes P1 and P2, with the following CPU and I/O burst times. PI P2 CPU - 3 CPU - 4 Net - 4 Disk - 3 CPU - 2 CPU -3 Disk - 3 Net - 3 Each row shows the required resource for the process and the time that the process needs that resource. For example “Net 3" in forth row says that P2 needs network card for 3 time units. If P2 arrives 2 time units after P1 and the scheduling policy is non-preemptive SJF (Shortest Job First), then calculate the finish time for each process and the CPU idle time in that duration.