1. Given a graph represented by an array of linked lists (refer to the ppt discussed in class today), write an algorithm (pseudo code) to determine if the graph is connected 2. A century after Euler's discovery, another famous puzzle-this one invented by the renowned Irish mathematician Sir William Hamilton (1805-1865)- was presented to the world under the name of the Icosian Game. The game's board was a circular wooden board on which the following graph was carved. As a first step to finding a Hamiltonian circuit-a path that visits all the graph's vertices exactly once before returning to the starting vertex- for this graph, we must transform the game board into a graph representation Two suggestions were presented in class for the above: (1) each corner represents a vertex, (2) each space contained between the lines represents a vertex. Discuss the merits of each of the two suggestions and select the one that is advantageous in your analysis