C Programming

In this final project you are given the opportunity to design and develop a C program that simulates CPU Scheduling Algorithms Implementation: Write a C program that simulates CPU Scheduling Algorithms. Your program should support only uniprocessor mode and implement the following scheduling algorithms: • First Come First Serve (FCFS) • Non-preemptive Shortest Job First (SJF) • Non-preemptive Priority (0 to 99 priorities inclusive, where 0 means highest priority) • Round Robin (RR) with Quantum = 10 As this is a simple CPU scheduling simulator, you're not required to simulate I/O operations, I/O waiting state, interrupts, and/or context switches. However, you should implement your own queue, priority queue, and any other relevant data structure you might need.