Suppose you have a stream on words and any point, you had to report to the user the 10 most repeated words at the best time possible. (a) Would you use a Heap, BST, or a 2-3 tree? Why? (b) Use the data structure you chose to write pseudo-code for this algorithm. (c) What's the worst-case running time for your implementation