Draw the binary search tree that results from adding the integers (6 1 8 4 3 5). Use AVL for balancing, and be sure to indicate balance factors. A useful rule: If the balance factor of a node is -2, and the balance factor of its left child is +1, the long path is in the right subtree of the left child. This can be fixed by performing a left rotation on the left child of the root, and a right rotation of the original node.