Signature 1. Create a hash table using the given hash function and the key values below. Linear probing collision resolution policy will be used. Show your work 80, 5, 30, 60, 10, 20, 7 H(key_value) (key_value) MOD (the size of the hash table) Write a complete C++ program to implement your construction. (50 points) 2. Create an AVL tree using the following key values. Show your work. This means show the changes of each insertion to the tree including the balancing factor.(50 points) 80, 5, 30, 60, 10, 20, 7,50, 100