3 AVL Trees Assume the following notation/operations on AVL trees. An empty AVL tree is denoted E. A non-empty AVL tree T has three attributes: The key T.key is the root node’s key . The left child T.left is T’s left subtree, which is an AVL tree (possibly E) The right child T.right is T’s right subtree, which is an AVL tree (possibly E) (a) [5 marks] Write a function RANGECoUNT(T, lo, hi) to count
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured