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 delete the records with key = 30 and key = 20,do the following:

A) Delete keys 20 and 30 from node B
B) Delete keys 20 and 30 from node B, move key 15 from B to A and delete node B
C) Delete keys 20 and 30 from node B, and move key = 10 from A to B
D) Delete keys 20 and 30 from node B, and move 50 from C to A