Q24,paper2 ,D13. For any B-tree of minimum degree t ≥2, every node other than the root must have atleast ________ keys and every node can have at most ________ keys.

(A) t – 1, 2t + 1

(B) t + 1, 2t + 1

(C) t – 1, 2t – 1

(D) t + 1, 2t – 1

Answer C.