This code needs to be programmed using C.

1 CPU Scheduler In modern computer systems, it is common for users to have many programs running at one time. One of the most basic functions of an operating system is to schedule these processes. For this project, we will assume a very simple round-robin scheduler. This simply means that each process gets to run for a set amount of time (e.g., 1 seconds time slot). If the process does not finish, it goes to the end of the line and the next process gets to run. This policy is very fair and very easy to implement. The best way to implement this policy is through the use of a single-linked circular list. A node structure is shown in Figure L Process ld Execution timer Next Figure 1: A process node struct. A circular linked list should be firstly created from the input of text file. For instance, a linked list of the available processes are created by reading the test1.txt file with contents of P1:(1,3), P2:(2,1), P3:(3,2). The Figure 2 shows the circular linked list created from the available processes Figure 2: A new process is added to the end of the linked list