Figuer: -Each Node of the B-Tree Can Contain at Most 4

Multiple Choice

Figuer:
-Each node of the B-tree can contain at most 4 keys.To insert into the B-tree a record with key = 25,do the following:

A) Split the node labeled B
B) Insert the record into the node labeled B
C) Insert the record into the node labeled A
D) Split the node labeled C