$1.$ Disk I$/$O requests have been queued up$.$ Requests for I$/$O arrived for the following cylinders in this order. $(3$ points$)$

$$

$10,93,110,34,192,49,87,3,123$

$$

The read$/$write head just finished reading a sector on cylinder $50.$ If the disk scheduling algorithm is SSTF$,$ and assuming no new requests enter the queue, what would be the $3$rd cylinder accessed after $50?($Don$$t count $50$ as the $1$st access. The next access after $50$ is the $1$st$.)$

$$

$$

$$ b$.$ Apply SCAN Scheduling to serve the requests on cylinders $98,183,37,122,14,124,65,67.$ Please draw a matrix to show the read$/$write head movement with SCAN alogrithim. $(3$ points$)$

$$