10.24 write a program that implements the following disk-scheduling algorithms: a. fcfs b. sstf c. scan d. c-scan e. look f. c-look your program will service a disk with 5,000 cylinders numbered 0 to 4,999. the program will generate a random series of 1,000 cylinder requests and service them according to each of the algorithms listed above. the program will be passed the initial position of the disk head (as a parameter on the command line) and report the total amount of head movement required by each algorithm.

given the lack of choices, i'm gonna wing it and say that pushing your car off a cliff might not be the best idea. your car might sustain damage from the fall and will probably result in the car being too damaged to jump start.

if that's not good enough, avoid filling the car with bees. bees might get agitated when trapped or during the moving process, and might result in death or painful stings that will make jump starting your car very difficult. but in the event that you do choose to fill your car with bees, remember to wear protective gear!