Answer the code in C language only not c++, cheers!

Don't just copy-paste from others work, make an original code of your own

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.

In a square maze, we can have multiple steps from 's' to reach 'e' with one place that can only be visited once. Example: Input Output 3 These are the unique steps: . 4 S.. .eu 4 2 These are the unique steps: ** .S.. .#.# #e