Python Language: Word Sleuth Program wish to further break it down into (i) a function that walks the grid in a direction you specify andthe string read-out that it encounters; and (ii) a function that checks if the word appears in theread-out string.make_unique (1st: list[str]) - list[str] takes a list of words 1st (with possible dupli-cates) and returns a list of words from 1st, each with exactly one copy.Example: Suppose you call word_sleuth withwords =["bog", "moon", "rabbit", "the", "bit", "raw"]and the following grid:[["r","a","w","b","i","t"],["x","y","z","c","h"],'i","e"],["p","q"["t",["u","w","x",["n","m","r","w","o","t"]],"g"],,"i","t"],This should return a list with the following members ["raw", "bit","rabbit", "bog", "the"].Your program must output the same set of words but may (and probably will) output them in a differentorder. Note: even though bit appears twice in the grid, we only list it once in the output.Ground Rules:For this task, you must not import any package. You must build everything fromscratch.Performance Expectations: While in this class, we aren't crazy about speedy code, your code mustnot be excessively slow. For this problem, it means finishing under 1 second on a 75x75 grid withabout 50 words in the input. Word sleuth (also known under various other names) is a popular word game found in newspapersand puzzle books. In such a puzzle, letters of words are placed in a grid, and the objective is to find andmark all the words hidden inside the grid.You can read words:horizontally from left to right;vertically from top to bottom;• diagonally from top-left to bottom-right; ordiagonally from bottom-left to top-right.A word w appears in a grid if w can be found along one of these directions of reading, with the lettersof w appearing consecutively along the path of reading.In this task, you’ll implement a functionword_sleuth(grid: list[list[str]], words: list[str])that takes as parameters:• grid-a 2-dimensional list representing the input grid, and• words –a list of words whose presence you look for in grid.Your function will return a list of all the words in the words list that appear in the grid. The words mayappear in any order in the output list but may not contain duplicates.How to Get Started?You will want to break this problem into a few functions, each representing alogical unit of task. We suggest writing at least the following helper functions:contains_word(grid: list[1ist[str]], w: str) - bool takes the grid from above andone single word and checks if the grid contains the word w. To implement this function, you may

Question

Python Language: Word Sleuth Program wish to further break it down into (i) a function that walks the grid in a direction you specify andthe string read-out that it encounters; and (ii) a function that checks if the word appears in theread-out string.make_unique (1st: list[str]) -> list[str] takes a list of words 1st (with possible dupli-cates) and returns a list of words from 1st, each with exactly one copy.Example: Suppose you call word_sleuth withwords =[&#34;bog&#34;, &#34;moon&#34;, &#34;rabbit&#34;, &#34;the&#34;, &#34;bit&#34;, &#34;raw&#34;]and the following grid:[[&#34;r&#34;,&#34;a&#34;,&#34;w&#34;,&#34;b&#34;,&#34;i&#34;,&#34;t&#34;],[&#34;x&#34;,&#34;y&#34;,&#34;z&#34;,&#34;c&#34;,&#34;h&#34;],'i&#34;,&#34;e&#34;],[&#34;p&#34;,&#34;q&#34;[&#34;t&#34;,[&#34;u&#34;,&#34;w&#34;,&#34;x&#34;,[&#34;n&#34;,&#34;m&#34;,&#34;r&#34;,&#34;w&#34;,&#34;o&#34;,&#34;t&#34;]],&#34;g&#34;],,&#34;i&#34;,&#34;t&#34;],This should return a list with the following members [&#34;raw&#34;, &#34;bit&#34;,&#34;rabbit&#34;, &#34;bog&#34;, &#34;the&#34;].Your program must output the same set of words but may (and probably will) output them in a differentorder. Note: even though bit appears twice in the grid, we only list it once in the output.Ground Rules:For this task, you must not import any package. You must build everything fromscratch.Performance Expectations: While in this class, we aren't crazy about speedy code, your code mustnot be excessively slow. For this problem, it means finishing under 1 second on a 75x75 grid withabout 50 words in the input. Word sleuth (also known under various other names) is a popular word game found in newspapersand puzzle books. In such a puzzle, letters of words are placed in a grid, and the objective is to find andmark all the words hidden inside the grid.You can read words:horizontally from left to right;vertically from top to bottom;• diagonally from top-left to bottom-right; ordiagonally from bottom-left to top-right.A word w appears in a grid if w can be found along one of these directions of reading, with the lettersof w appearing consecutively along the path of reading.In this task, you’ll implement a functionword_sleuth(grid: list[list[str]], words: list[str])that takes as parameters:• grid-a 2-dimensional list representing the input grid, and• words –a list of words whose presence you look for in grid.Your function will return a list of all the words in the words list that appear in the grid. The words mayappear in any order in the output list but may not contain duplicates.How to Get Started?You will want to break this problem into a few functions, each representing alogical unit of task. We suggest writing at least the following helper functions:contains_word(grid: list[1ist[str]], w: str) -> bool takes the grid from above andone single word and checks if the grid contains the word w. To implement this function, you may

Accepted Answer

Python code

def make_unique(matrix, singleWord, x, y,numberOfRow, numberOfColumn, stire) :
    l =…