1) Start the Disk Scheduling app. 2) Click on the Example button, which fills the list with some requests. 3) Select First-Come First-Served from the pull-down menu and click the Run button. Time the app with your watch or the computer's clock, and write down how many seconds it takes. 4) Select Shortest Seek Time First and run the app again. Measure the time that takes and write it down. Also write down the order of the tracks that are visited. (This is different from the original request list.) 5) Repeat step 4 after selecting SCAN Disk (elevator). 6) Which algorithm took the least time? 7) Based on your observations of the three algorithms on the example request list, state what kind of request list would make first-come, first-served take up a lot of time. In other words, what pattern would the numbers in the request list have to follow so that first-come, first-served consumes a lot of time