Please help to design the algorithm in C to print the total num berr of unique steps, please use backtracking algorithm. Based on the problem :

- Input where integer followed by the maze, Output where total num berr of unique steps.(do not print the unique steps)

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 4 These are the unique steps: . u w s.. .eu 4 2 These are the unique steps: ** .S.. .#.# #e #