Problem Desсrіption You are to develop a program that plays the perfect game of

Problem Desсrіption
You are to develop a program that plays the perfect game of Tic-tac-toe. It should never lose. Your project can be done in three steps of increasing complexity.
Develop the Tree ADT as an array-based concrete implementation. Your program will then create every possible
Tic-tac-toe board configuration organized as a tree.
Generate a Game Tree of all the possible moves but only print out the first 100. The code for this is shown below in section 2.2. The root of the tree is the empty board. Turn in ArrayTree.java and GenTree.java (which will include the main method which prints the first 100 board positions).
I attached the TestTreeADT below.