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:

Design a class tictactoe that: holds the following information about the game: two-dimensional array (3 by 3), and winner. add additional variables as needed. includes the functions to perform the various operations on objects. for example, function to print the board, getting the move, checking if move is valid, determining if there is a winner after each move. add additional operations as needed. includes constructor(s). write the functions of the class, and write a program that uses the class. the program should declare an object of type tictactoe. the program will create the board and store it in the array. the program will allow two players to play the tic-tac-toe game. after every valid move update the array, check if there is a winner. if there is no winner and no tie, then print the board again to continue.