In a B+ - tree where each node can hold at most four key values, a root to…

In a B+ - tree where each node can hold at most four key values, a root to leaf path consists of the following nodes:

A = (49, 77, 83, -), B = (7, 19, 33, 44), C = (20*, 22*, 25*, 26*)

The *-marked keys signify that these are data entries in a leaf.

Assume that a pointer between keys 𝑘1 and 𝑘2 points to a subtree containing keys in [𝑘1, 𝑘2), and that when a leaf is created, the smallest key in it is copied up into its parent.

A record with key value 23 is inserted into the B+ - tree.

The smallest key value in the parent of the leaf that contains 25* is __________. (Answer in integer)