Using the following key-value pairs, answer to the the questions: (98, Brent), (76, Amyntas), (54, Sharar), (31, Fedele), (23, Olav), (46, Dhrama), (78, Isiah), (64, Calixto), (57, Osheen), (43, Hippokrates), (52, Anatoliy), (34, Prasad), (77, Kepa) Insert the key-value pairs in a hash table of size 10. What happens if the hash function is not good? How to solve the problem without changing the hash function? (Suppose we don't know what is a good hash function) Insert the key-value pairs inside a BS-Tree. Do an in-order tree walk over the tree to print out the contents. What is the average search time in the tree if it is balanced? What is the worst case scenario for a BS-Tree and what would be the average running time for that case? Use heapsort to sort the key-value pairs. You have to show each step of making a heap (Only the result of heapify). And how step by step you sort the result (only result of heapify)