Given the disk access sequence, in this order:

$111,91,69,29,110,17,22,31$

Show the actual access sequence graph and total arm movement count for the following algorithms, presuming a start from track $42$:

First Come, First Served

Shortest Seek First

Elevator, with the initial head direction towards the lower block numbers of the disk. Requests are filled in both directions, turning the head around after the highest and lowest request on each end.

A file system that uses $2$K blocks and $8$ byte pointers has two possible implementations; linked data blocks and the UNIX combined file allocation scheme with $10$ direct blocks.

For each implementation, answer the following questions:

What is the maximum file size?

How many blocks would need to be accessed to get to the next to last block of a $128$GB file?