Consider the $B^{+}$ tree in the adjoining figure, where each node has at most two keys and three links.
Keys $K15$ and then $K25$ are inserted into this tree in that order. Now the key $K50$ is deleted from the $B^+$ tree resulting after the two insertions made earlier. Consider the following statements about the $B^+$ tree resulting after this deletion.
- The height of the tree remains the same.
- The node
(disregarding the links) is present in the tree.
- The root node remains unchanged (disregarding the links).
Which one of the following options is true?
- Statements (i) and (ii) are true
- Statements (ii) and (iii) are true
- Statements (iii) and (i) are true
- All the statements are false