Assuming that Balance factoris defined asenum data type and the following definitions of Binary node and AVL node are used in implementing AVL tree, what will be the possible problem with implementing insert and delete? Give a thorough answer. Write your solution to fix the problem as well. templatecclassEntry structBinary nodef Entrydata; Binary nodeEntry*left; Binary node*right; Binary node(); Binary node (constEntry&x); 1: template { Balance factor balance; AVL node( ); AVL node (co nst Record 8x); void set balance(Balance.factorb) Balance factorget ba lance )const; 1: Assuming that Balance factoris defined asenum data type and the following definitions of Binary node and AVL node are used in implementing AVL tree, what will be the possible problem with implementing insert and delete? Give a thorough answer. Write your solution to fix the problem as well. templatecclassEntry structBinary nodef Entrydata; Binary nodeEntry*left; Binary node*right; Binary node(); Binary node (constEntry&x); 1: template { Balance factor balance; AVL node( ); AVL node (co nst Record 8x); void set balance(Balance.factorb) Balance factorget ba lance )const; 1