Suppose that we insert the keys {1, 2, ..., 30} into an initially empty B-Tree with minimum degree 2. How many nodes does the nal tree have? DO NOT turn in pictures of all 30 trees. Bonus (up to 10 points): If we insert the keys {1, 2, ..., n} into an initially empty B-tree with minimum degree 2, how many nodes does the nal tree have?