Employ structured programming to develop this game with the following playing rules: - At start of the game, prompt for the following o. Two unique names representing the of 2 players. o Size of the game board, that must be odd number and at least 3 . - The computer randomly decides which player to start and will take the symbol X The other player will take the symbol O. - Each player in turn will place a domino-style tile that occupy 2 EMTPY squares. o Your program must validate the 2 squares that the player wanted to place the next tile In the above board, if a player enters 0010 for his next tile, it is invalid as 00 is already occupied. - In the above board, if a player enters 1112 for his next tile, it is invalid as 12 is already occupied. - If player enters 21.32 for his next tile, it is invalid as the 2 squares are not connected vertically or horizontally. - Game ends when no player can place any more tile. - Player with the most tiles on the board wins. - If the result is a tie, repeat the game until a winner can be determined. after many more placing of tiles Jane, place your 0 tile: 4243 B1234axx=10x2=00x3=0=004=00= Alan, place your x tile: 3040 After Alan's tile, there are 812348xx=1x0x2=00x30=00400= no more squares to fit another tile. Alan 10 - Jane 8 Alan is the winner!l Create the following functions as building blocks for the XO domino-tile game program: - getNevBoard(size: int): list o This function should create and return a nested list based on the given parameter size, representing an empty game board (Hint each empty square is defaulied to ) - priniboard(board: list) o This function displays the current gane board, showing placed tiles" location through ' X ' and ' O. - getNexitile(playerName: siring symbol: string, size: int), string, string o. This function prompts the player to enter the 2 squares to place the next domino-tile. o This function will validate and return the 2 squares (as 2 strings) if they are within the game board Otherwise, the function will prompt the player to re-enter the 2 squares. - validateTile(squarel: string, square2; string, size: int): Boolean o This function takes in 3 parameters: squarel, square2 (e.g., '00', '01') and the size of the board. The function should return True if the given squarel and square2 can form a valid domino-tile. Otherwise, returns False. - For example. - validateTile('00; 01; 5) returns True - validareTile (00; 20;, 5) returns False - validareTile ("00; 11;5) returns False - placeTile(board: list, symbol: string, squarel: string, square2; string): Boolean - This function returns True if squarel and square2 can be updated with the given symbol. In other words, squarel and square2 are empty for the next. tile to be placed - The function returns False if either squarel or square2 are not empty. - isGameAlive(board: list): Boolean - This function should look through the board and retum True if there are still 2 vertically linked or horizontally linked EMPTY squares on the board to allow the next domino-tile to be placed. Otherwise, returns False. You will need to code other functions to complete the program. Paste screenshots of game play that covers these scenarios: - Player entering wrong coordinates (not empty, wrong row/column etc.) - Player wanted to place next tile in occupied square(s). - Game finishes with a winner. - Game repeats when the result is a tic. - Game with a different game board size