Create a dictionary of at least 30 words with Hash Table. Instead of using a linked list to resolve collisions, as in separate chaining, use a binary search tree. You’ll create a hashtable that is an array of trees.