Consider an imaginary disk with $40$ cylinders. A request come to read a block on cylinder $11$. While the seek to cylinder $11$ is in progress, new requests come in for cylinders $1, 36, 16, 34, 9$ and $12$ in that order. The number of arm motions using shortest seek first algorithm is
- $111$
- $112$
- $60$
- $61$