A multi-level queue scheduling algorithm partitions the ready queue into several separate queues. The processes are permanently assigned to one queue, generally based on some property of the process, such as memory size, process priority, or process type. Each queue has its own scheduling algorithm. Implement a multilevel queue scheduling for a system having 3 different types of process queues. The code must take number of processes, their burst time and type of the process as input and return turnaround time and waiting time for each input processes. [14M] Code for implementation of the multilevel queue scheduling [10M], Correct turnaround time for all the processes [2M], Correct waiting time for all the processes [2M]