Problem
1. Define the terms internal and external path length of a 2-tree. State the path length theorem.
2. What is the smallest number of comparisons that any method relying on comparisons of keys must make, on average, in searching a list of n items?