#2 please

1 4 7) (13 a) Put the dummy nodes in b) Now illustrate the search c) Ill place to search for 4 and 12 how would you delete the root, and redraw the tree after deleting the root d) Write down the pre-order tree traversal data. e) Write down the post-order tree traversal data. 2. Consider Hashing of the following data: (11, 400, 37, 56, 220, 125, 78) Find out the hash value for cach key. Assume the hash function as: h(k) - k mod m. Assume size of the hash table as 11. Then illustrate how would you construct the hash table, avoid any collision by using the double hashing. The second hash function is as given below h2(k)-10-(k mod 10) Write a C++ Program that would take a set of integers as keys and then create a hash table of size m, where m is user input. Your program must have different options for collision resolving. The following functions you need to use: 3. Value Return Function h(k) which will take an integer data k as input and would return the hash value using h(k)- h mod k . .Rehash function that takes two inputs: i and k (both integers) and returns the rehash value using the function: rehash(k, i) (h(k)+i'g) mod m However, to obtain g you have to call g function that would return 1, ci + c2i or 10-(k mod 10) depending on option I(linear probing), 2 (quadratic