In Binary Search Tree, the fun method. What would happen if the line node. left $-$ insert$($node left, key$)$: is replaced with node. left $-$ insert$($node$.$right, key$)$;Node fun $($Node node, int key$)$ if $($node $==$ null$)($return new Node $($d key$)$ ;if $($key $>-$ node. key$)1$node. right $=$ fun $($node: node. right,key$)$;$\}$else if $($key $<=$ node $.$key$)$node$.$ left $=$ fun $($node: node. left, key$)$return node; A$.$ The BST would not be configured correct. B$.$ The BST would be reversed in order.O C$.$ The BST would become AVL Tree.O D$.$ The BST would become full BST$.$