$1.$ Character team preparation

$($a$)$ Create two AVLTree objects, each tree to hold the experiences of one game

character, where each experience is represented by a String object and can rep$-$

resent a challenge, powerup, etc.. Decide on your own unique experiences for

each character, assuming that all game characters can earn the same experiences

$($b$)$ Insert between $3$ and $5(3,4$ or $5)$ experiences into each character$$s experience

tree using standard tree operations

$2.$ Access and analysis of character data

$($a$)$ To display all characters$$ experiences, print an informative message and then

use a inorder 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

$3.$ Character experience update

$($a$)$ Delete one experience from one of the character trees using standard tree oper$-$

ations

$($b$)$ Perform another inorder traversal on the tree edited in step $3$a$.$

$4.$ With a legible drawing or photo in the document, draw the full search tree for one of your characters implemented in Java coding step $1($with all values inserted$),$

including the balance factor for the root node