Using NACHOS, implement Round Robin (RR), Shortest Job First (SJF) both preemptive and non-preemptive SJF, and Priority (PRIO) Scheduling

#Budget is $80 #All the code must be done in JAVA. #Time is 48 hours # I cannot send the video attached with the description so I will send the two zipped files through the chat system. #After I send you the zipped two files, you can follow the assignment. #First, unzip the Nachos_ThreadSchedulingAlgo, and check a short video called "Nachos_ThreadSchedulingAlgo". Using Nachos, in this assignment your job will be to enhance the thread scheduler to implement the following three scheduling algorithms: Round Robin (RR), Shortest Job First (SJF), and Priority (PRIO) Scheduling. For SJF and PRIO, you will be implementing both the preemptive and non-preemptive versions. So total, you will implement 5 algorithms. Currently, Nachos uses First Come First Served (FCFS) scheduling. After you make your enhancements, FCFS should still run exactly as it did before you started. #The amount of code is not too much (PROBABLY around 50 lines of code) but it is just important to follow the "403-Project1-f22" file in the zipped file. #Second, I will send you an hour long video for some further understanding which is "That-One-hour-video" zipped file.