Overview:Priority Scheduling is a non$-$preemptive or preemptive CPU scheduling algorithm used in operating systems to determine which processes should be allocated CPU time based on their priority. Each process is assigned a priority, which is typically an integer value. During execution, processes with higher priority values are given precedence over processes with lower priority values. The primary goal is to optimize system performance, ensure timely execution of critical tasks, and achieve desired system objectives, such as maximizing throughput, minimizing response time, or meeting specific service$-$level agreements $($SLAs$).$Task: Implement the Priority$-$based CPU scheduling algorithm in any programming language. Each process will have a priority, and higher$-$priority processes should be executed before lower$-$priority ones.Evaluation Criteria:$$Ensure that your program accurately implements the Priority Scheduling algorithm, considering both static and dynamic priority assignment strategies where applicable.$$The execution of your program should provide a clear simulation demonstrating how processes are scheduled based on their priorities. The output should indicate the execution sequence and any relevant metrics, such as waiting time and turnaround time.$$Provide a comprehensive comparison between static and dynamic priority assignment strategies.