CMSC 341 Project 4 -- Spring 2001 Edit this file and answer the following questions about project 4. The answers to these questions make up 10% of your project grade. 1. The theoretical height of a B-Tree of order M with N elements is log N (base M). How does the height of your B-Tree compare to the theoretical height? Give an example to support you claim. 2. When doing "lazy" deletion, the value to be deleted was simply "flagged" as deleted, but not really removed from the leaf. What effect, if any, did lazy deletion have on future operations if the value to be deleted was also a key in one or more interior nodes?