Question 4 4.1 Two communicating devices are using a single bit odd parity check for error detection. The transmitter sends the following 7 bits data: 0000000 0101111 1001100 1010110 1111111 Calculate code word for bit checking of each of the above data. [10] 4.2 Consider the following set of processes, with the length of the CPU burst given in milliseconds Process Burst time Priority 3 B 2 2 1 2 6 2 2 2 The processes are assumed to have arrived in the order A, B, C, and Dall at time 0. (0) Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: Shortest Job First (SJF). First Come First Served (FCFS), Round Robin (RR), Modified Round Robin (MRR) which gives priority 1 processes a double quantum and priority 2 processes a single quantum whenever they are scheduled. [5] (ii) Calculate the average turnaround time for each of these scheduling algorithms. [5] (iii) Calculate the average waiting time for each of these scheduling algorithms. [51