please complete the following in JAVA Implement the graph ADT using the adjacency list structure. thanks! also posting a similar question for adjacency matrix. have a good day!

I need the code from start to end with no errors and the explanation for the code ObjectivesJava refresher (including file I/O)Use recursionDescriptionFor this project, you get to write a maze solver. A maze is a two dimensional array of chars. Walls are represented as '#'s and ' ' are empty squares. The maze entrance is always in the first row, second column (and will always be an empty square). There will be zero or more exits along the outside perimeter. To be considered an exit, it must be reachable from the entrance. The entrance is not an exit.Here are some example mazes:mazeA7 9# # ###### # #   ## # # #### #     ## ##### ##       ########## RequirementsWrite a MazeSolver class in Java. This program needs to prompt the user for a maze filename and then explore the maze. Display how many exits were found and the positions (not indices) of the valid exits. Your program can display the valid exits found in any order. See the examples below for exact output requirements. Also, record…

Ques: Demonstrates two resources bundles by displaying the string associated with each key for both the defaut [English] version and German version (In Java by.) solve it soon as possible

1) What is the difference between a list and a tuple? And when do we use them? 2) What is encapsulation? Why do we use it 3) What is a constructor in a class and how can we define it? 4) What are Overriding and Overloading 5) What are the differences between a list and a set? 6) What is the difference between the Python identity operator (is/is not) and the equality operator (==/!=)? Where to use them and where not? 7) What is the difference between OOP and Functional programming? 8) What are iterators, generators, and decorators in Python