I'm a beginner in JAVA:

The Process Scheduler relies on a scheduling algorithm, based on a specific scheduling policy, to allocate the CPU in the best way to move jobs through the system efficiently. Write a Java program that will simulate the following process scheduling algorithm:

2. Shortest Job Next (SJN)

Your Java program should produce tables to presents computed results for each scheduling algorithm as shown in the following sample data for the validation your programs computed results for each scheduling algorithm.

B) Timeline for Shortest Job Next (SJN) algorithm: 12 15 20 Arrival CPU Start Finish Time Cycle Time Time Turnaround Time Finish Time Arrival Time Job 17-0=7 20 20-1=19 12 | 12-2=10 15 15 3 12 9 |9-4=5 5 15 2 12 2 Average Turnaround Time l (7 + 19 + 10 + 12 + 5)/ 5 53 / 5 = 10.6 B) Timeline for Shortest Job Next (SJN) algorithm: 12 15 20 Arrival CPU Start Finish Time Cycle Time Time Turnaround Time Finish Time Arrival Time Job 17-0=7 20 20-1=19 12 | 12-2=10 15 15 3 12 9 |9-4=5 5 15 2 12 2 Average Turnaround Time l (7 + 19 + 10 + 12 + 5)/ 5 53 / 5 = 10.6