Consider the following keys which are inserted in a B Tree:
18, 4, 2, 46, 48, 29, 30
Suppose the order of B Tree is 3, which is the minimum keys a node can store. Which among the following keys will lead to internal node splitting?
1
1, 3, 19
2
50, 45, 20
3
50, 49, 60
4
21, 19, 50, 25