Problem
1. Fill in code for the PersonPairDirectory class of Code Fragment 2.14, assuming person pairs are stored in an array with capacity 1,000. The directory should keep track of how many person pairs are actually in it.
2. Write a Java program that can take a positive integer greater than 2 as input and write out the number of times one must repeatedly divide this number by 2 before getting a value less than 2.