Module 5: Hash table 1) Given an array A 145, 22, 11,47, 44, 33, 23, 65) and a hash function H(v) v mod 7, construct a 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 tree. 1011 12 13 3) A binary tree is called a complete binary tree if each internal node has exactly two child nodes. Determine the number of leaf nodes and the number of internal nodes in a complete binary tree of height 4) Given a binary tree, find the height of the internal nodes of the tree and determine whether the tree is height-balanced or not. a) b) 5