Write a program to simulate Round Robin CPU scheduling algorithm. I. Print the Gantt chart. II. Print waiting time time, and completion turnaround time in tabular Input: N (no. of processes), Q (Time quantum), N by 3 matrix in which the first column represents the process ID (process ID must equal the row number of this matrix), the second column contains the arrival time of the corresponding process and the third column contains the burst time of form. III. Print average turnaround time and waiting time. processes. 4. 3. Write a program to simulate the Best fit contiguous memory allocation technique which leads to smallest possible internal fragmentation. I. Print which block is allocated to which process in tabular format in which the column name could be Input: N (no. of processes), M (no. of memory blocks), An array of N space separated integers, each denoting the size of the process and index of the array corresponds to the (process ID, process size, allocated block, allocated block size) Print which blocks suffer .