Do problems 17.1-3 (p410 2/e), viz, 
0) A sequence of n operations is performed on a data structure.
The i'th operation costs i if i is an exact power of 2, and 1 otherwise.
Use aggregate analysis to determine the amortized cost per operation.

1) A sequence of stack operations is performed on a stack whose size never
exceeds k. After every k operations, a copy of the entire stack is made
automatically for backup purA,poses. Show that the cost of n stack operations
including copying the stack, is O(n) by assigning ammortized costs to the
various stack operations.

2) Do problem 17-2 "Making binary search trees dynamic" (p426 of 2/e).
Do parts a and b (not c).

3) Adapt the aggregate proof of theorem 21.1 to obtain amortized time bounds of
O(1) for MAKE-SET and FIND-SET and O(lg n) for UNION using the linked-list
representation and the weighted-union heuristic for Disjoint Sets.

4) Do 21.2-2p504 

5) Do 21.3-1 and 21.3-2