s consider a B$-$Tree of order $M,$ where $L$ is the maximum number of records per leaf We assume that the $B-$tree stores $N$ records.

t one or more:

a$.$ The remove operation costs $O(logM(N)logM+logL)$ in the best case

$.$ The total cost of the Find operation is $O(lo{g}_M(\frac{N}{L})log\frac{M}{2})$ in the worst case

C$.$ B$-$tree is used when the data cannot all fit in RAM

d$.$ The total number of leaf nodes are $M-1$