Q34,paper2,D 12.The maximum number of keys stored in a B-tree of order m and depth d is

(A) md + 1 – 1
(B) (md+1 – 1)/(m-1)
(C) (m – 1) (md + 1 – 1)
(D)(md – 1)/(m – 1)
Answer(A)