s = [[0,0,7, 0,0,0, 0,1,5],

[0,0,0, 3,9,7, 0,0,0],

[0,6,2, 0,1,0, 4,0,9],

[0,2,0, 0,0,1, 5,4,3],

[7,0,0, 4,0,9, 0,0,1],

[4,8,1, 2,0,0, 0,6,0],

[9,0,6, 0,2,0, 7,3,0],

[0,0,0, 9,8,4, 0,0,0],

[1,5,0, 0,0,0, 2,0,0]

] Question 3 – Constructing a Strategy (3 points) There are several strategies that may be used to solve a sudoku puzzle, but the simplest is the so-called “process of elimination.” Using this strategy, we examine a cell's environment to see how many numbers are possible. This should be reasonably simple, since the range of possible values is known, and we already have three functions which perform the three checks necessary there is only one value that is allowable, then the value gets written into that cell. If there is more than one possibility, we leave the cell blank. If there are no possible values for this cell, then the information given in the puzzle contradicts the three rules of sudokus. In this case, we will raise a “Sudoku Invalid” exception. Write a function 'elimination(x,y,s)' that, given a zero-indexed x and y position in the puzzle (x' and 'y' respectively), and a sudoku puzzle s, returns the either a zero or “blank” if there is more than one possible answer, the answer if there is exactly one possible answer, and raises a “Sudoku Invalid” exception if there are no possible answers. def elimination (x, y, s) In return False YOUR CODE HERE Test Cases In 1: instantiateCases ) elimination (6,4,s) == 8 In []instantiateCases elimination (0,0,s) == 0 In 1: instantiateCases ) try elimination (5,6,s4) print(“This test failed as no exception occured”) except print(“This test passed as an exception occured”)