You are not allowed to use any built-in Java API Data Structure classes to implement this assignment except where noted. You may use Scanner, InputStreamReader, or any other class that you wish for keyboard input. After watching Google's Al, AlphaGo's Go match with the best Go player in the world, you feel motivated to start moving into the Artificial Intelligence field of Computer Science. However, even though you want to Go, you have no clue where to start. It seems the world is playing chess, and you're just trying to play checkers. Perhaps the simplest game to brute-force is Tic- Tac-Toe. Your job is to build a Tic Tac Toe Al that can't lose. In order to do this, you will have to build a game tree for tic tac toe. Original Board Move 1 (partial) Possibilities after move 1 (partial) Move 2 (partial) Possibilities after O IXI IXIO XL move 2 (partial) You are not allowed to use any built-in Java API Data Structure classes to implement this assignment except where noted. You may use Scanner, InputStreamReader, or any other class that you wish for keyboard input. After watching Google's Al, AlphaGo's Go match with the best Go player in the world, you feel motivated to start moving into the Artificial Intelligence field of Computer Science. However, even though you want to Go, you have no clue where to start. It seems the world is playing chess, and you're just trying to play checkers. Perhaps the simplest game to brute-force is Tic- Tac-Toe. Your job is to build a Tic Tac Toe Al that can't lose. In order to do this, you will have to build a game tree for tic tac toe. Original Board Move 1 (partial) Possibilities after move 1 (partial) Move 2 (partial) Possibilities after O IXI IXIO XL move 2 (partial)