Consider the following $B^+$ tree with the order of internal and leaf nodes as $3$ and $2$ respectively:
The minimum number of key insertions that causes a new level to be introduced in the above $B^+$ tree ________. (Assume key redistribution is not allowed)