PLEASE READ THE QUESTION CAREFULLY AND FIRST MANUALLY SOLVE THE PROBLEM WITH BACKTRACKING METHOD AND THEN IMPLEMENT A PYHTON CODE FOR THE QUESTION I AM PROVIDING BELOW :

STEP-1 : MANUALLY SOLVING BACKTRACKING METHOD 3 EXAMPLES BELOW IN PICTURE OF CODE

STEP-2 : PLEASE IMPLEMENT A PYTHON CODE FOR THE BELOW QUESTION

79. Word Search - LC - Medium - 79. Word Search (local copy_) - 39.8 Medium - Process - Step 1: Following the examples shown on Word Search to manually solve the problem - Step 2: Implement a Python solution using the algorithm Word Search and test the Python code Given an mn grid of characters board and a string word, return true if word exists in the grid. The word can be constructed from letters of sequentially adjacent cells, where adjacent cells are horizontally or vertically neighboring. The same letter cell may not be used more than once. Example 1: Input: board = [["A","B","C","E"],["S","F","C","S"],["A", "D", "E", "E" ]], word = "ABCCED" Output: true Example 2: Input: board =[[ "A","B", "C", "E" ],["S","F","C","S"],["A","D","E","E"]], word = "SEE" Output: true Example 3: Input: board = [["A,"B","C","E"],["S","F","C","S"],["A","D","E","E"]], word = "ABCB" Output: false Constraints: - m== board. length - n= board [i].length - 1