mplement the following $3$ CPU scheduling algorithms

$$ Simulate and evaluate each with the set of eight processes below.

$$ Use any programming language. The program listing should be submitted with the report.

$1.$ FCFS non$-$preemptive $($partial results provided$)$

$2.$ SJF non$-$preemptive

$3.$ MLFQ

Multilevel Feedback Queue $($absolute priority in higher queues$)$

Queue $1$ uses RR scheduling with Tq $=5$

Queue $2$ uses RR scheduling with Tq $=10$

Queue $3$ uses FCFS

All processes enter first queue $1.$ If time quantum $($Tq$)$ expires before CPU burst is complete, the

process is downgraded to next lower priority queue. Processes are not downgraded when preempted by a

higher queue level process. Once a process has been downgraded, it will not be upgraded