 A minimal implementation can get by with just two record buffers and a few program variables.Naming the four tape drives as A, B, C, D, with the original data on A, and using only 2 record buffers, the algorithm is similar to Bottom-up implementation, using pairs of tape drives instead of arrays in memory.The basic algorithm can be described as follows