POINTS for fast and right answer. Do in Java

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 track and the disk contains 256 tracks per surface. Each track holds 10 sectors numbered 0 through 9. b. A seek takes 12 + 0.1T 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 0509 23 1356 25 202 29251 2009 45 1755 57 1803 83994 88 735 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. 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 track and the disk contains 256 tracks per surface. Each track holds 10 sectors numbered 0 through 9. b. A seek takes 12 + 0.1T 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 0509 23 1356 25 202 29251 2009 45 1755 57 1803 83994 88 735 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