2-3 trees basics. Suppose we insert the following numbers into a 2-3 tree (which is initially empty), in the given order: 9, 15, 4, 3, 6, 13, 2, 11, 7, 1, 16, 12, 14,8, 10,5. (a) Draw a picture of the 2-3 tree after each insertion: you do not have to write down the guides at each node just the tree structure and the values stored at the leaves. (b) Suppose that now a split operation is performed, which splits the tree into two trees: one containing those numbers 8. Show the resulting trees (again, you can omit the "guides")