In a B tree, what is the minimum number of children for each non$-$root internal node?

a$.1$

b$.0$

c$.3$

d$.2$