Algorithms and Data Structures write the python code that finds the list of all possible words that can be formed by a sequence of adjacent characters on the m n boodgle board

Extra Problem: Boogle Board Game - Write the Python code that finds the list of all possible words that can be formed by a sequence of adjacent characters on the MN boogle board. - You are allowed to search the word in all eight directions, i.e. North, North-East, Bast, South-East, Sorth, South-West, West, North-West. Hint: Use modification of depth-first search algorithm that starts from each character in the matrix and explore all eight paths possible and recursively check if they leads to a solution or not. \# Input: board=[[M,S,E],[R,A,T],[L,,O,]]] dictionary = ["STAR", "NOTE", "SAND", "STONE"] \# Dictionary of valid words