Make a Java program for the following prompt/scenario:

Solving a maze is an "amazing" experience! It involves a great deal of trial and error as you follow a path and backtrack when necessary - when you cannot go any farther. The only valid moves through the maze are up, down, right and left. The goal is to move from the top left corner (entry point) to the bottom right corner (exit point). At first, a 1 indicates a clear path and a 0 indicates a blocked path. As the maze is solved, these array elements are changed to other values to indicate attempted paths and finally a successful path through the maze, if there is one! You will use a 2-D array of integers to represent the maze. The maze is 8 rows by 13 columns.

I need a program that is a solution to this problem so that I can see what I'm doing wrong.

Thanks for any help! I'll be sure to leave great feedback if you help me with my question.