The original input was: 3  0 1 5 1  0 1 5 1  3 1 5 1 
The (sorted) input is:  3  0 1 5 1  0 1 5 1  3 1 5 1 

The scheduling algorithm used was Uniprocessor

Process 0:
	(A,B,C,IO) = (0,1,5,1)
	Finishing time: 9
	Turnaround time: 9
	I/O time: 4
	Waiting time: 0

Process 1:
	(A,B,C,IO) = (0,1,5,1)
	Finishing time: 18
	Turnaround time: 18
	I/O time: 4
	Waiting time: 9

Process 2:
	(A,B,C,IO) = (3,1,5,1)
	Finishing time: 27
	Turnaround time: 24
	I/O time: 4
	Waiting time: 15

Summary Data:
	Finishing time: 27
	CPU Utilization: 0.555556
	I/O Utilization: 0.444444
	Throughput: 11.111111 processes per hundred cycles
	Average turnaround time: 17.000000
	Average waiting time: 8.000000