What is the best case height of a B-tree of order n and which has k keys?

• A. logn (k+1) – 1
• B. nk
• C. logk (n+1) – 1
• D. klogn