using python

Q3. [45] Implementation of AVL tree operations. For Q1 - Q2, implement the operations (insert, remove, restructure, etc.) of AVL tree in Python. Print the resulting tree from the root in the following format: (a key of node: a depth of node, a height of node, a key of parent, a key of left-child, a key of right-child). e.g.) (50: 0,4, null, 40, 78). In the implementation of Q2, you can create the initial tree of Q2 either through a series of insertion of the keys or using the assignment statements. e.g.) insert 50, 40,78, 20, 62,88, 55, 70. Or e.g.) After instantiation of the nodes, fill its fields with the information: node key = 50, node.left=v1, noderight=v2 vi. key = 40. v1.parent = node, 12. key = 78, 12.parent - node, etc. Since AVL tree is a balanced Binary Search Tree, you may be able to reuse (or modify) your Python codes of certain functions from HW 2. In the main program, Invoke the functions such as AVL-Insert(10), AVL-Insert(40)... AVL-Remove(20), then print the result of the final tree. In the 'print' statement, include the proper description of output as well as the results e.g.) print("Q1. Insertion of 10, vikoy, v.depth. ...v.height) Run your program and insert the image of your output. Q4. [10] AVL Tree Professor Amadeus claims that the order of keys to be inserted into an AVL tree does not matter, i.e. the same tree always results every time. Give a counter example that contradicts Prof. Amadeus's claim