Objective IN JAVA:

PLEASE FOLLOW DIRECTIONS ACCORDINGLY. This problem is widely accepted as the problem that gave birth to graph theory, and was solved by Swiss mathematician Leonhard Euler (1707-1783). The problem states is it possible in one single walk could a person traverse all seven bridges in Konigsberg exactly once and return to the starting point. The graphic below shows how the seven bridges are configured. Solve the problem by creating a graph that models the environment, and determine if this can be done by traversing every possible combination. You will only get half credit if you take the node degree route.