Consider a CPU that has to execute two types of processes. The first type, Actuators (A), requires a CPU burst of 6 seconds. The second type, Controllers (C), requires a CPU burst of 8 seconds. A new process of type A arrives at time $t = 10, 20, 30, 40,$ and $50$ (in seconds). Similarly, a new process of type C arrives at time $t = 11, 22, 33, 44,$ and $55$ (in seconds). The CPU scheduling policy is First Come First Serve (FCFS). The first process of type A starts running at $t = 10$ seconds. The average waiting time (in seconds) for the 10 processes is ________. (rounded off to one decimal place)

We have 10 processes with arrival times ($AT$) and burst times ($BT$):

• Actuators ($A$): $BT = 6$ s at $AT = 10, 20, 30, 40, 50$

• Controllers ($C$): $BT = 8$ s at $AT = 11, 22, 33, 44, 55$

Sorting all processes by arrival time in FCFS order:

1. $A_1$: $AT = 10$, $BT = 6$

2. $C_1$: $AT = 11$, $BT = 8$

3. $A_2$: $AT = 20$, $BT = 6$

4. $C_2$: $AT = 22$, $BT = 8$

5. $A_3$: $AT = 30$, $BT = 6$

6. $C_3$: $AT = 33$, $BT = 8$

7. $A_4$: $AT = 40$, $BT = 6$

8. $C_4$: $AT = 44$, $BT = 8$

9. $A_5$: $AT = 50$, $BT = 6$

10. $C_5$: $AT = 55$, $BT = 8$

Now, let's schedule them with FCFS and compute Start Time ($ST$), Completion Time ($CT$), and Waiting Time ($WT = ST - AT$):

Total Waiting Time:

Average Waiting Time: