Your goal is to use a sorting algorithm and several data structures you developed this

semester to create a program that finds all the anagrams of a given word. Insertion sort

works well on short amounts of data, which is perfect for this task. BSTMap, AVLTreeMap,

and MyHashMap implement the MyMap interface. So$,$ with proper object$-$oriented

programming techniques, specifically the use of polymorphism, you can create any one of

these data structures and refer to it from a MyMap reference. Though all three classes

implement the same interface, their methods are implemented very differently, leading to

different execution times on the computer. You will time your program$$s execution to see

how each of the data structures performs