Requests are not usually uniformly distributed. For example, a cylinder containing the file system FAT or in odes can be expected to be accessed more frequently than a cylinder that only contains files. Suppose you know that 50 percent of the requests are for a small, fixed number of cylinders. a. Would any of the scheduling algorithms discussed in this chapter be particularly good for this case? Explain your answer. b. Propose a disk-scheduling algorithm that gives even better performance by taking advantage of this “hot spot” on the disk. c. File systems typically find data blocks via an indirection table, such as a FAT in DOS or in odes in UNIX. Describe one or more ways to take advantage of this indirection to improve the disk performance.