Do the following: 1. [10 %] add code to test the deleteNode and search member functions. Save screenshot of your test program run. 2. [25 %] add code to implement the nodeCount member function of class BinaryTree. Test it and save screenshot of your test program run. 3. [25 %]add code to implement the leafCount member function of class BinaryTree. Test it and save screenshot of your test program run. 4. [40 %] The insert member function uses an iterative algorithm to insert a new value into the BST. Define a new insert function name it recursiveInsert that uses a recursive algorithm instead. Hint: watch video tutorials. Write a test program to test your function and save a screenshot of a test run showing your insert function works properly. Deliverables: