Minimax search on a tic-tac-toe game 1. Consider the tic-tac-toe board state shown in Figure 1. Draw the full minimax search tree starting from this state, and ending in terminal nodes. Show the utility value for each terminal and non- terminal node. Utility values are +1 if "X" wins, 0 for a tie, and -1 if "O" wins. Assume that "X" makes the next move. XOX O Fig. 1: A tic-tac-toe board state. Must be in python and the chapter subject is "FUNCTION PARAMETERS" so must be focused on that! Please see picture, thank you! Complete the Print Tic Tac Toe function with parameters horiz_char and vert_char that prints a tic-tac-toe board with the characters as follows def print tic tac toe(horiz_char, vert_char): FIXME: complete function to print game board return Ex: print tic tac toe("-", T) prints: x!x!x xIxIx NNN N N XIX Ex 2 Your solution goes here!!! 3 4 print tic tac toe('','')