CODE SHOULD BE IN PYTHON. Add comments so that i can understand the code fully.

You have to implement the Round Robin Scheduling Algorithm. You are required to implement a queue of processes. You are required to implement this queue using linked list. Here the linked list will not have a capacity. Every process has two attributes; a name and total time required to complete that process. You can use a class to implement a process. A small time slice or quantum is defined; all the tasks are kept in queue. The CPU scheduler picks the first task from the queue, sets a timer to interrupt after one quantum, and dispatches the process. If the process is still running at the end of the quantum, the CPU is pre-empted and the process is added to the tail of the queue. If the process finishes before the end of the quantum, the process itself releases the CPU voluntarily. In either case, the CPU scheduler assigns the CPU to the next process in the ready queue. Your code should design a scheduler for any given number of tasks. Your code should be menu driven. Your menu should look like: 1 Add a task 2 Delete a task 3 Run Scheduler 4 Exit You may add any other options if need be. When the scheduler is running, the program should print the current state of the scheduling queue, until the entire queue has no processes remaining. Make sure you print each iteration of the scheduler. Once the scheduler has started, the user will not be able to add any more tasks.

PROBLEM 4 You have to implement the Round Robin Scheduling Algorithm. You are required to implement a queue of processes. You are required to implement this queue using linked list. Here the linked list will not have a capacity. Every process has two attributes; a name and total time required to complete that process. You can use a class to implement a process. A small time slice or quantum is defined; all the tasks are kept in queue. The CPU scheduler picks the first task from the queue, sets a timer to interrupt after one quantum, and dispatches the process. If the process is still running at the end of the quantum, the CPU is pre-empted and the process is added to the tail of the queue. If the process finishes before the end of the quantum, the process itself releases the CPU voluntarily. In either case, the CPU scheduler assigns the CPU to the next process in the ready queue. Your code should design a scheduler for any given number of tasks. Your code should be menu driven. Your menu should look like: 1 - Add a task 2 - Delete a task 3 - Run Scheduler 4 - Exit You may add any other options if need be. When the scheduler is running, the program should print the current state of the scheduling queue, until the entire queue has no processes remaining. Make sure you print each iteration of the scheduler. Once the scheduler has started, the user will not be able to add any more tasks