Pick N. Draw the opt graph. It has 2N+1 nodes. We define a "lazy request" to be a request where the offset is zero. At every point in the opt graph, write the distribution given by the formula. At every point in the opt graph, define the lazy potential to be the maximum expected cost if the adverary makes only lazy requests. Prove that the needed inequality is satisfied by the non-lazy requests. Do it again for a larger N. At some point, you will realize that as N goes to infinity, the formulas become more and more complicated, but that the limiting formlas are simple. Write it down.