Problem 2 (1 pt). First, the following is an example of a 2-3-4 tree that results from an empty tree and the following sequence of inserted values: 40, 30, 50, 20, 10, 5, 1, 2, 31, 32, 25, 26, 27, and 28. Insert: 40,30,50 20, Causes the root to split 10, 5 Causes the (10,20,30) node to split Causes the (1,5,10) node to split Insert: Causes the (1,5,10) node to split Causes the root to split Causes the (30,31,32) node to split 26,2728Causesthe(25,26,30)nodetosplitCausesthe(26,31,40)nodetosplit As a sanity check, note that all nodes have between 1 and 3 keys, and all leaves are at the same level. Your task is to draw a 2-3-4 tree that results from an empty tree and the following sequence of inserted values: 40,60,20,50,55,45,42,47,10