4)(10pts) Assume, an operating system serves non uniformly distributed disk requests. (For example: directory structures may reside on the outermost cylinders and accessed more frequently than the files.) Suppose, it is also known that, 50% of the disk requests are for a small fixed number of cylinders. If you were the OS designer, which disk scheduling algorithm(s) would you prefer and why? Give sufficient details with examples.