Write a complete Java program, parse an input graph representation to determine whether it contains a Eulerian path or a Eulerian circuit. Developing code assuming the graph in stored in an adjacency matrix.

You should write a complete program that:

Reads in a graph representation (copy/paste from the inputs below, or have the end-user type it in if you prefer).

Determines whether the graph contains a Eulerian path/circuit and prints the result.

But there is a short-cut! Before you begin coding, draw out the input graphs on paper. One quick-and-easy way to determine if a graph contains a Eulerian path or circuit is to trace the graph once youve drawn it. If you can trace over the graph without re-tracing any edges and without picking up your pen, then you have discovered a Eulerian path/circuit.

Do this for every graph in the lists below, and see if you can find a pattern: What characteristics do the Eulerian graphs have in common? If you can apply this insight to your code, itll be much faster to write.

Sample Inputs -- Adjacency Matrices

Graph #1 0 1 1 0 1 0 0 1 1 0 0 1 0 1 1 0	Graph #2 0 1 1 1 1 0 0 1 1 0 0 1 1 1 1 0	Graph #3 0 1 1 1 1 0 1 1 1 1 0 1 1 1 1 0
Graph #4 0 1 1 0 1 1 0 0 1 1 1 0 0 1 1 0 1 1 0 1 1 1 1 1 0	Graph #5 0 2 1 0 2 0 1 1 1 1 0 1 1 1 1 0	Graph #6 0 2 1 0 1 2 0 0 1 1 1 0 0 1 1 0 1 1 0 1 1 1 1 1 0