What is the minimum levels of B+ tree index required for 5000 keys and order of B+ tree node (P) is 10. (Assume P is the max pointer possible to store in B+ tree node)
My answer was 3.
With: Keys <= (Internal Order)^levels * (Leaf Order)
i.e., 10^3 * 9 = 9000 >= 5000 .. So 3 levels req. But given answer is 4.