Explain

For the 2-3 tree problems in the quiz, use the level-by-level order to represent them: root node is considered level 0 , then level 1, and so on. For the sample 2-3 tree below, the root value 50 is the level 0 . And 10 and 70 are the level 1 . For the 23 tree, add a number "90" After that, add a number "100". For the heap problems in the quiz, use the level-by-level order to represent them. For a sample max heap below, the root value 30 is the level 0 . And 10 and 20 are the level 1. To the sample heap, add a number "50". After that, add a number "12". For the Assume that you construct a hash table using the separate chaining for the following 7 keys: 31,72,20,14,9,2,32 Assume also that the hash function is h(K)=Kmod5. For the problem, do not consider the rehashing. After constructing the hash table with the keys, select all indexes in the table which have any collision(s). In other words, choose all indexes with more than one item in the index. 2 4 6 7 5 0 3 1