Hi, I need help with this assignment. Make sure to answer each part clearly and the answers must be legible, Thanks.

35 20 40 10 25 45 300 Eigure 1 AVL Tree Inserting a node 1. Draw the Binary Search Tree resulting from the insertion ofan entry with key 32 into the AVL tree in Figure 1. 2. Indicate on this tree the three nodes that will be involved in Trinode restructuring 3. Perform the trinode restructuring (using the handout on Titanium) and draw the final AVL tree b. Deleting a node. 1. Draw the Binary Search Tree resulting from the deletion ofthe entry with key 400 into the AVL tree in Figure 1. (start all over fromthetreeinfigure 1,not from the result of part 2. If the tree is unbalanced, indicate on this tree the three nodes thatwill be involved in Trinode restructuring 3. If the tree is unbalanced, perform the trinode restructuring and draw the final AVL tree. 4. Is the tree balanced? If not, repeat step