Maze Problem

You are given a maze arranged as rows and columns, where 0 marks an open cell and 1 marks an obstacle. Determine a valid route from the supplied start coordinate to the supplied destination coordinate using a shortest-path strategy. Return the coordinates visited along that route. If the destination cannot be reached, return No Path. Both the start and destination are valid open cells located on the outer border of the maze. The maze dimensions are n x m, where 1 <= n, m <=…