can you send it to an expert

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 one or more:

a$.$ The total cost of the Find operation is $O(lo{g}_{\frac{M}{2}}Nlog\frac{M}{2})$

in the worst case

b$.$ The total cost of the Find operation is

$\frac{M}{2}+log\frac{L}{2}$ in the worst case

c$.$ The total cost of the Find operation is $O(log\frac{M}{2})$ in the

worst case

d$.$ The total cost of the Find operation is

M$/2)$ in the best case