(Solved): The 2-3-4 recursive search process starts from the node. a) left b) right c) root d) middle1 Que ...

The 2-3-4 recursive search process starts from the node. a) left b) right c) root d) middle1 Question \( 7(10 \) points) \( \quad \checkmark \) Saved In the following 2-3-4 tree, a right rotation on the root's left child moves key into the root and 12 into the root's middle1 child. a) 18 b) 35 c) 22 d) 10 In the following B-tree, which recursive search call is made when searching for key \( 14 ? \) a) BTreeSearch (node \( \rightarrow \) left, key) b) BTreeSearch (node \( \rightarrow \) middle1, key) c) BTreeSearch( node \( \rightarrow \) middle2, key) d) BTreeSearch( node \( \rightarrow \) right, key)