7. [B-Trees - 10 points]. that has height 3? (b) (3 points) What is the minimum number of keys we can store in a B-Tree of order 128 that has height 3? c) (4 points) In class we proved that the search time for finding a key in a B-Tree is O(mlogn). In this problem, we'd like you to explain each of the factors m, and logmn in that result: i. Tell as much as you can about the factor m ii. Tell as much as you can about the factor log n