Above is the partial implementation for the Binary Search Tree (BST) operations. 1. Explain what operatorl serves for in a single sentence. 2. Write the C++ code for operator 2 whose goal is to find the minimum data in a BST. 3. The operator3 function is supposed to delete all the leaves in a BST. Correct the bugs in the code. Do not re-write the function - just state how you want to correct the mistakes in the code in a single sentence