With this algorithm, the disk driver accepts requests one-at-a-time serves
them in incom´ing order. This is easy to program and an intrinsically fair algorithm. However, it is not optimal with respect to head movement because it does not consider the
locaton of the other queued requests. this results in a high average seek time.
