In the context of insertion of a key K into a B tree of order m, state whether true or false: (i) If

In the context of insertion of a key K into a B tree of
order m, state whether true or false:

(i) If the node X of the B tree of order m, where the key K
is to be inserted, can accommodate K, then it is inserted in the node and the
number of child pointer fields are appropriately upgraded.

(ii) If the node X where the key K is to be inserted is
full, then we apparently insert K into the list of elements and split the list
into two at its median Kmedian.

(a) (i) true (ii) true (b) (i) true (ii) false

(c) (i) false (ii) true (d) (i) false (ii) false