1. Show that in a binary tree there is (1/4)-(3/4) edge separator of size 1 . Here we are assuming edges and vertices are unweighted and we want to balance the vertices. Generalize this theorem to trees where each node has degree at most d. 2. Show that in any tree, the bisection width (i.e., the number of nodes that must be removed in order to partition the tree into two equal-sized (to within 1) pieces is at most O(logn)