Disk requests come into the disk driver for cylinders $10,22,20,2,40,6,$ and $38,$ in that

order. Assume that the disk has $100$ cylinders numbered $0$ through $99.$ The arm $($head$)$ is

initially at cylinder $20.$

Based on the following disk scheduling algorithms, draw scheduling diagram indicating

the movement of the head as arm $($head$)$ moves around the cylinders services the

requests.

i$.(5$ points$)$ First$-$come, First$-$served$($FCFS$)$