Suppose we minimize the average time to store n files of lengths l1, l2, , ln on a tape. If the probability of requesting file k is given by pk, the expected access time to load these n files in the order k1, k2, , kn is given by the formula The constant C represents parameters such as the speed of the drive and the recording density.

(a) In what order should a greedy approach store these files to guarantee minimum average access time?

(b) Write the algorithm that stores the files, analyze your algorithm, and show the results using order notation.

averageC averageC