Send me Proper runnable program files and its output for following (Note: dont send code only send its runnable files)

In this exercise, you will implement the alsoNice(int n) system call that will increase the amount of time slice allocated to the program that calls it.

The default xv6 scheduler uses a simple FCFS and RR policies with each process having the same time slice (T).

(20 points) The program that calls alsoNice() will have its time slice increased to n times T.

(20 points) After alsoNice(), your xv6 will now execute programs with different time slices. In addition to FCFS with RR, we ask you to at least implement LTSF (largest time slice first) and STSF (shortest time slice first) with RR.

(Up to 15 points)For additional credit, you can implement other scheduling algorithms.

(10 points) We ask you to analyze and compare the different scheduling algorithms that you implement. You need to be clear about the criteria that you use to compare them

To implement alsoNice(), you will need to understand how xv6 handles timer interrupts and process preemption. The xv6 code for these functionalities is basically in proc.c and trap.c.