Question: $20$

I need step by step answer for my better understanding

Which of the following is true about a B$-$tree of order m$?$

A$.$ Every node has at most m children

B$.$ Every node has exactly m children

C$.$ Every node has at least m children

D$.$ Every node has at most m$-1$ children

If You Write AI Answer $-$ I will give $15$ Dislikes For Sure.