The disjoint sets analysis in Section 8.6 can be refined to provide tight bounds for small N.
a. Show that C(M, N, 0) and C(M, N, 1) are both 0.
b. Show that C(M, N, 2) is at most M.
c. Let r ≤ 8. Choose s = 2 and show that C(M, N, r) is at most M + N.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.