1Opp)/ Balanced Binary Search Tree (BST) and AVL/ Suppose you have the pointers t, a, D. c for nodes in the below tree. 6. (10pt) /Balanced Bi typedef struct node ( int key struct node left, right; ) nodeT, treeT a. (2pt) First find bf (balance factor) for each node in the below figures. bf.5 bf. 2 b. (2pt) Re-draw the tree after the right rotation