Suppose that the following processes arrive for execution at the times indicated. Each process

will run for the amount of time listed. In answering the question, use non$-$preemptive scheduling,

and base all decisions on the information you have at the time the decision must be made. If two

or more processes are identical in terms of scheduling criterion, you should give precedence to

the process that has the smallest process ID $($PID$)$ number.

What is the turnaround time for process ID $($PID$)3$ with the First Come First Served $($FCFS$)$ scheduling

algorithm?