We can modify the algorithm of Section 23.5.2 to use buckets whose sizes are powers of 2, but there are between p and p + 1 buckets of each size, for a chosen integer p > 1. As before, sizes do not decrease as we go further back in time.
a) Give the recursive rule for combining buckets when there are too many buckets of a given size.
b) Show that the fractional error of this scheme is at most 1/2p.