Part B (6 marks] There are three processes; X, Y, and Z and they will run in a system using a single processor. The burst sequence type and time (i.e. CPU and L/O) for each process is given in Table 2 below. All VO operations for processes Y and Z are competing and are dealt with using First-In-First Out I/O operations for process X does not compete with any L/O operations from process Y nor from process Z. Assume that all processes arrive in Ready state at the same time, ignore context switch time and use the five state model for the operating system. Processesin the Wait/Block state are released as soon as their individual request has been satisfied. Table 2: Burst sequence and time for process X, Y and Z 10 10 10 a) 3 marks] Calculate the total elapsed time to complete all three processes if there is no pre-emptive scheduling and the processes are run in the order X, Y, and Z. 13 marks] Write down the sequence of steps that results in the smallest total elapsed time for all processes to complete and calculate the total elapsed time. Assume that the operating system will not pre-empt a process while it is actively using the CPU. b)