Assignment 8

1. Show by induction that if tree T has height d then T has <= 2^d leaves. Not to be handed in.
2. Prove that any comparison-based search algorithm must have running time at least "capital-Omega"(log n) (even if the original list is sorted).Turn this one in.