Use java to create two AVLTree objects, each tree to hold the experiences of one mixed martial arts game character, where each experience is represented by a String object and can represent a challenge, special ability, etc.. Decide on your own unique experiences for each character, assuming that all the games fighter characters can earn the same experiences, For example, each experience can be something like a $$level$$ or $$boss$($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 Study BST$.$java and AVLTree.java for methods to call to run the traversals $($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 defeated the $$final boss$$ 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$).$