Construct a B+ tree for the following set of key values under the assumption that the number of key values that fit in a node is 3. Key values (4,11,13,15,30,39,46,56,61,69) Show the step involve in the following insertions

Construct a B+ tree for the following set of key values under the assumption that the number of key values that fit in a node is 3 . Key values (4,11,13,15,30,39,46,56,61,69) Show the step involve in the following insertions