1. Given the tree as in the figure below: Show the changes after performing the following operations to the original tree as above a. Insert 77 b. Delete the root c. Insert 23 d. Delete 20 Question: Open addressing is an approach to avoid collision in determining the index of an element in a hash table. Common hash function is based on modulo operation where hash(K)=Kmodm a. Complete the following hash table through the insertion based on separate chaining for following items in the given order (from left to right): 34, 3, 20, 12 \begin{tabular}{r|c|c|c|c|c|c|c|c|c|c|c|} index & 0 & 1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 & 9 & 10 \\ \hline item & & & & & & & & & & & \\ \hline \end{tabular} b. Draw another hash table of size 13 that is produced by inserting using linear probing for the following items in the given order (from left to right)