This project aims to create a Java$-$based simulator that visually demonstrates various CPU scheduling algorithms. The simulator will allow users to input parameters such as the number of processes, their arrival times, burst times, and the scheduling algorithm to be used. It will then visually simulate the execution of these processes and provide performance metrics. Required Features: $1.$ Process Creation: o Allow users to input the number of processes. o Generate random or user$-$defined arrival times and burst times for each process. o Create process objects with their respective attributes. $2.$ Scheduling Algorithm Selection: Implement at least three common CPU scheduling algorithms : $$ First$-$Come$-$First$-$Served $($FCFS$)$ Shortest Job First $($SJF$)$ Round Robin $$ Multilevel scheduling $($with $3$ different priorities; $1,2$ and $3),$ using the following algorithms: Q$1($priority$=1)$ Priority scheduling Q$2($priority$=2)$ Priority scheduling Q$3($priority$=3)$ Shortest Job First Processes enter the queue according to its priority. To avoid starvation, the process from the lower queue will be upgraded to higher queue after a certain time threshold to avoid starvation. The threshold is to be set by the user. $3.$ Simulation: o Simulate the execution of processes based on the selected algorithm. $4.$ Performance Metrics: o Calculate and display performance metrics such as: $$ Average waiting time $$ Average turnaround time