Designing a flexible tree structure. This is a UML/JAVA assignment worth 30% and a tricky one for the geniuses out there!

(a) Design a tree structure that you will implement and subclass to solve both the Huffman Coding Problem and either the AVL or Splay Tree problem.

(b) Include a class diagram showing all the supporting classes of this tree structure.

(c) Explain your decisions.

(d) Include a class diagram showing how you Huffman Coding implementation will extend your general tree structure

(e) Explain your decisions textually

(f) Include a class diagram showing how either your AVL Tree or Splay

Tree implementation will extend your general tree structure.

(g) Explain your decisions textually

(h) Explain why you chose either the AVL Tree or the Splay Tree to solve question 3, referencing your diagrams and decisions as is appropriate.

2. Implement a Huffman Coding Tree based off of the design in question 1.

(a) Your tree should build itself using

https://users.encs.concordia.ca/~sthiel/comp352/Jabberwock.txt

(b) Include the characters for spacing as well as all punctuation, but not line breaks.