Let us consider a B$-$Tree of order M$.$

Select one or more:

a$.$ The actual records $($data$)$ can be stored in any node

b$.$ The B$-$tree is binary if $M=2$

c$.$ The height of the B$-$Tree is equal to $logM$

d$.$ Each non leaf node has up to M$-1$ keys