A Binary Search Tree is constructed by inserting the following sequence of keys one by one:
$$40,20,10,30,60,50,70$$
Suppose we delete the root node $(40)$ using the Inorder Successor replacement strategy. What will be the new root of the tree, and what will be the total number of leaf nodes in the resulting tree?
- New Root$: 50;$ Leaf Nodes$: 3$
- New Root$: 50;$ Leaf Nodes$: 4$
- New Root$: 30;$ Leaf Nodes$: 3$
- New Root$: 60;$ Leaf Nodes$: 3$