The Harmonic heuristic with parameter M, denoted H(M), is the following. For each k  1, 2, . . . , M − 1, items of size 1 k+1 < wi ≤ 1 k are packed separately, at most k items per bin. That is, items of size greater than 1 2 are packed one per bin, items of size 13

< wi ≤ 1 2 are packed two per bin, etc. Finally, items of size wi ≤ 1 M are packed separately from the rest using First-Fit.

Given n items drawn randomly from the uniform distribution on (16

, 0], what is the asymptotic number of bins used by H(5)?