Implement the function find_diagonal_win_2(board) whose parameter is a 2

dimensional list that represents a Tic-Tac-Toe game. The function attempts to find

out whether there is a winner in the right to left diagonal only. It does not consider

columns, rows or the left to right diagonal.

If the top right to bottom left diagonal contains 3 ‘X’ characters, print “X is the winner”.

If the top right to bottom left diagonal contains 3 ‘O’ characters, print ‘O is the

winner”.

If there is no winner, after considering all columns, print “There is no winner”

The template file contains 3 test tic-tac-toe boards for testing but you should try some

of your own as well.

Hints:

● since this function only considers the right to left diagonal, it will not catch

other ways to win, even though you can see other wins in the data.

● You can depend on the board being 3 x 3 square and the only contents will be

‘X’, ‘O’ or ‘ ‘

● This problem might be solvable with nested loops but I used a single loop

over a 2 dimensional list instead.

The output from the provided test data is:

>>> find_diagonal_win_2(board1)

There is no winner

>>> find_diagonal_win_2(board2)

O is the winner

>>> find_diagonal_win_2(board3)

There is no winner Those two go together. The program is Python.

# CSC-401 Assignment 4

# Due: May 1, 11:59 PM

# Author: <Sonya Jackson>

# Collaborators: <None>

# <DESCRIBE COLLABORATION, CONTRIBUTION OF EACH PERSON, ETC.>

#

# Don’t forget to delete ‘pass’ from each function

# Don’t forget doc strings