Assume that you are given a maze $($shown on the right$)$ which is stored in an array called maze as shown in the code below. Write a piece of code that determines the number of dead$-$ends in the maze. A dead$-$end is a location that has exactly three walls around it in the up$/$down$/$left$/$right directions $($see the $7$ circles in image$).$ Your code should count the dead$-$ends and display the total. Your code must work for any maze, not just this one. You may assume that the maze only contains $1\text{'}$s and $0\text{'}$s$,$ that the other borders are all $1\text{'}$s and that the maze is always of size $10$x$10.$