10. Suppose that T is a full Binary Tree where all leaves are at level p or higher. Prove by Mathematical Induction that for k = 0, 1, … , p the number of vertices at level k is exactly 2k. // because each internal vertex has two vertices below it 11. (a) How would you sort A[1], A[2], …, A[400] if each entry is either 0 or 1? (b) How would you sort A[1], A[2], …, A[400] if each entry is one of ten possible values X[1] < X[2] < … < X[10]?