Use java to create two AVLTree objects, each tree to hold the experiences of one boxing game character, where each experience is represented by a String object and can represent a challenge, special skill like $$night night uppercut$,$ etc.. Use unique experiences for each character like primetime fights for publicity or high wager fights for more money, assuming that all the games boxing characters can earn these same experiences. OPTIONAL ADVANCED: Instead of merely the tree, define a custom Character class that contains other character attributes such as name along with the experience tree

For example, each experience can be something like a $$level$$ or $$prime time fight$$ or $$big purse fight$$ or $$title fight$$

$($b$)$ Insert between $3$ and $5(3,4$ or $5)$ experiences into each character$$s experience tree using standard tree operations. Try the insert method

$2.$ Access and analysis of character data $($a$)$ To display all characters$$ experiences, print an informative message and then use a in order traversal to print out all experiences in each character$$s tree $($b$)$ Search your character trees, using the standard tree operations, to determine which of the two characters has earned the $$highest level$$ experience among the two, and print out the result. For example, search both character trees to determine which of them has won the $$title fight$$ step

$3.$ Character experience update $($a$)$ Delete one experience from one of the character trees using standard tree operations $($b$)$ Perform another in order traversal on the tree edited in step $3($a$).$