In a square maze, we can have multiple steps from ‘s’ to reach ‘e’ with one place that can only be visited once. Example: The problem: ➢ Input: an integer followed by the maze. ➢ Output: total number...

In a square maze, we can have multiple steps from ‘s’ to reach ‘e’ with one place that can only be visited once. Example:

The problem:

➢ Input: an integer followed by the maze.

➢ Output: total number of unique steps. (no need to print the unique steps)

➢ Task: Design an algorithm in pseudocode/code to print the total number of unique steps using a backtracking algorithm.

Extracted text: Input Output 4 s.. These are the unique steps: ..# 4 2 These are the unique steps: ... .#.# #e.#