2. From the example BST given below identify two nodes (nodel and node2 - specified by their key (letter)) such that the resulting compound operations (when performed on the original tree) yield different trees. D A CE K G Operation 1: delete(nodel) followed by delete(node2) Operation 2: delete(node2) followed by delete(nodel) (a) (2 points) Write down the nodes that satisfy the resulting tree from Operation 1 NOT EQUAL to the resulting tree from Operation 2 nodel: node2: (b) (4 points) Draw the two resulting Binary Search Trees after each of those compound operations are performed on the original tree using your node choices from part a.