Suppose three processes A, B, C arrive in the system at the same time in that order, each has a series of estimated alternating CPU bursts and I/O bursts as follows:

A: 11ms (CPU), 2ms (I/O), 6ms (CPU)
B: 3ms (CPU), 8ms (I/O), 7ms (CPU)
C: 2ms (CPU), 1ms(I/O), 4ms (CPU), 1ms (I/O), 3ms (CPU)

Calculate the turnaround (completion) and wait times of all processes and the average of these times using each of the following scheduling algorithms:
Round Robin (RR) with 5ms time quantum, First Come First Serve (FCFS).
You must show the steps of your calculation.