Please write the code in Java. If the code actually works, I will definitely give a positive rating. Thanks in advance!

22. Write a program that will simulate the FCFS, SSTF, LOOK, and C-LOOK seek optimization strategies. Assume that: a. The disk's outer track is the 0 track and the disk contains 256 tracks per surface. Each track holds 10 sectors numbered 0 through 9. b. A seek takes 12 + 0.1* T ms, where T is the number of tracks of motion from one request to the next, and 12 is a movement-time constant. c. One full rotation takes 5 ms. d. Transfer time is 1.2 ms per sector. Use the following data to test your program: Arrival Time Track Requested Sector Requested 0 50 23 135 25 20 29 25 35 200 45 175 180 99 83 73 95 199 For comparison purposes, compute the average, variance, and standard deviation of the time required to accommodate all requests under each of the strategies. Consolidate your results into a table