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

The origin of the question is B-Trees topic in portion B-Trees of Data Structures & Algorithms I

This question was addressed to me in my homework.