Suppose a track is $n$ blocks. We want to read $k$ blocks stored randomly on the track. On

average, how far $($expressed as $in[0,1])$ around the track should we search to access

those $k$ blocks, once the read$/$write head is positioned on that track?Note that $=1$

means $1$ full rotation wait, and $=0$ means no wait.