4. Given the following adjacency matrix for a connected graph, G. Determine if G is a tree or not. Explain your answer in detail. Adjacency Matrix for the connected graph G: 0 0 0 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 1 1 0 0 0 0 1 0 0 0 0 1 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1