Consider different $2-3-4$ trees that contain a total of four keys spread across the node or nodes within a single level. What is the maximum number of nodes that can be found at the child level?