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

Select all that apply:

a. The remove operation costs O(log_M (N) x log M + log L) in the best case

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

c. The total cost of the Find operation is O(log_M (N/L) x log M + log L) in the best case

d. The total cost of the Find operation is O(log_M (N/L) x log M/2) in the worst case