Please do this correctly, and show how each tree is supposed to look.. I will upvote!!

Given an AVL Tree below.

$($a$)$ Label each node with its height. What is the height of the tree? $(2$ points$)$

$($b$)$ Insert a node of value $6$ in this AVL tree $($without restructuring$)$ and show which node violates AVL

property. $(4$ points$)$

$($c$)$ Restructure this unbalanced tree with Trinode Restructuring using Restructure algorthm $(4$ points$)$