PYTHON

HW #4: Arrays and Strings / 6. Question 6 saved DESCRIPTION GRADING 17 MY TEST 1 Given an NxN tic tac toe board with values (".0.X).return integer 0 (Game not over), 1 [X wins), 2 (O wins), or 3 (tie). A winner is declared if a full row.col, or full diagonal has either all Os or Xs. You may assume any given board is in a valid state and N >=3 Example: board [X, X, XI. [0, 0, X). ['0','X, 0] 1-> 1 [X wins) board [ I"..'0') 1", "XX") ["",X] 1 -> 0 (Game not over) Full Screen code.py New 1. def tic_tac_toe (board): 2 pass