Module 5: Hash table v mod 7, construct a 1) Given an array A (45, 22, 11,47, 44, 33, 23, 65) and a hash function H(v) hash table and determine the average number of comparisons for a successful search and unsuccessful search. Module 6: Binary Tree 1) Consider a binary tree with 89 nodes. Determine the minimum possible height of the tree 2) Given a tree, find the depth of all the leaf nodes and the height of all the internal nodes in the tre. 1011 12 13