Answer only question $2$ please

Question ap$,$ only the root ay and prin Hient $2$: $(25$ points$)$ Ins deleted AVL is a must preserve the prope following keys into AVL tre You bis a balanced binary tree sroperty of AVL after you AVL tree: $20,50,10,7,3,100,150,125,130$ You must show the balance such that each node show if the tree is balanced factor for each node has a balance factor in the range of $0,1,-1.$ and how you fix it$.$ Given the below points$)$ Binary Search Tree $($BST$)$