uppose that you are inserting a new key into a 2-3 tree. Under which one of the llowing scenarios must the height of the 2-3 tree increase by one? When the number of keys equals one less than a power of 2 When the number of nodes equals one less than a power of 2 When the final node on the search path from the root is a 3-node When every node on the search path from the root is a 3-node