Student Name: J#: 4) Given the following array, do the following (show all the work). A 56, 89,23, 58,22, 11, 45, 48, 90) (a - 5 pts) Construct a hash table for the given array using the hash function H(K)- K mod 5 (c- 3 pts) What is the worst case number of comparisons for an unsuccessful search in the hash table of number of comparisons for a successful search using the hash table of (d - 7 pts) Show the sequence of iterations algorithm. (e - 8 pts) Use the sorted array of (d) to construct a binary search tree (f-5 pts) Determine the average number of comparisons for a successful search in the binary search tree of (e). (g-8 pts) Determine average number of comparisons for an unsuccessful search in the binary search tree of (0) run on the array to get it sorted using the Selection Sort