In his paper quot;Should the two-headed disk be greedy? - Yes, it shouldquot; Hofri defined a quot;greedy policyquot; asfollows. Assuming that the range of disk addresses is [0,1], a request at location x is served by the closest arm whilethe other arm jockeys to a new position, z, where z =...