B$-$tree of order n is a order$-$n multiway tree in which each non$-$root node contains $\_\_\_\_\_\_\_\_\_\_$

a$.$at least $($n $1)/2$ keys

b$.$exact $($n $1)/2$ keys

c$.$at most $($n $1)/2$ keys

d$.$at least $2$n key