Objective: Implement a Python solution to navigate through a maze, applying the uniform cost search strategy.

What to submit: Your solution should be submitted as either a Jupyter Notebook $(.$ipynb$)$ or a plain Python script $(.$py$).$ Alongside your code, include a short explanation that breaks down how your solution works.

$\backslash$table$[[,0,1,2,3,4,5,6,7],[0,\backslash$table$[[$START$],[0]],8,16,24,32,40,48,56],[1,1,9,17,25,33,41,49,57],[2,2,10,18,26,34,42,50,58],[3,3,11,19,27,35,43,51,59],[4,4,12,20,28,36,44,,60],[5,5,13,21,29,37,45,53,\backslash$table$[[$FINISH$],[61]]],[6,6,14,22,30,38,46,54,62],[7,7,15,23,31,39,47,55,63]]$