You have a B-tree containing 99999 (approximately 100000) keys and with a minimum degree t=10. What is the maximum B-tree height. Hint: if minimum degree is t, then there are at least t-1 and at most 2t-1 keys in a node.