对于如下给定的一组磁盘访问进行调度,要求分别采用先来先服务、最短寻道优先以及电梯调度方法进行调度,要求给出每种算法中磁盘访问的顺序，计算出平均移动道数,假定当前读写头在90号，向磁道号增加的方向移动-For the following given to a group of disk access scheduling, the requirements were used to first-come, first serve, shortest seek priority scheduling methods, as well as elevator scheduling, required to give each disk access algorithm in order to calculate the average number of mobile Road, the assumption that the current read-write head in the 90 to track the direction of increase in its mobile