Consider using the BST delete() method to remove node 12 in the following tree. What will be the behavior of the standard algorithm seen in class? Delete starts at the root and finds that it is the node that needs to be removed. Node 14 replaces node 12. then sink 0 is run on it. Delete starts at the root and finds that it is the node that needs to be removed. Then the following nodes will be visited in the search for the replacement node. 15 . Node 15 replaces 12 and 14 is 5 et as 155 right child. Delete starts at the root and finds that it is the node that needs to be removed. Then the following nodes will be visited in the search for the replacement node: 7,10 . Node 10 replaces node 12, and node 7 no longer has a right child. Delete starts at the root and finds that it is the node that needs to be removed. Then the following nodes will be visited in the search for the replacement node: 15,14 . Node 14 replaces 12 and 15 becomes its right child. Delete starts at the root and finds that it is the node that needs to be removed. Node 15 replaces node 12. hen sink0 is run on it