In the list problem, when the P, are known, show that the best ordering (best in the sense of minimizing the expected position of the element requested) is to place the elements in decreasing order of their probabilities. That is, if P> P>> P, show that 1, 2, ..., is the best ordering.