Could you please draw sth on paper and download it? Because it will be much more clear to understand. TY

(0) We will briefly examine inserting a node into an AVL tree through an example. On the left, we have shown an AVL tree and to the right we show the result after a BST insert has happened. AVL Tree Before and After Insertion Devise a sequence of left and right rotations that will restore the AVL tree property. Explain for each rotation what is the root node at which we are rotating and which direction. If you wish, you may insert images showing the trees before/after rotation using markdown (see how we inserted the image. But do not forget to upload the images with the submission)