Write a Java program to find the number of paths possible for 0 to N stairs when the user and jump 1,2 & 3 stairs at a time. Take the n from the user in linear time

In a square maze, we can have multiple steps from ‘s’ to reach ‘e’ with one place that can onlybe visited once. Example: Input Output 3 s.. ..# .e# 4 These are the unique steps: *.. *.. **.   *.. **. .*.   **. .*. .*.   **. **. **. 4 .s.. .#.# #e.# .... 2 These are the unique steps: .**. ..*. .**. .**.   .**. ..*. .**. .... 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 code in C to print the total number of unique steps using a backtracking algorithm.