Let G be an undirected graph, which can be represented as

an adjacent matrix,

an adjacent list.

For each representation, explain what property of the data structure indicates that

the graph is complete,

the graph has no edges.

the graph is not complete, but there is a vertex that connects all other vertices.

the graph has a loop, i$.$e$.,$ an edge connecting a vertex to itself,

the graph has an isolated vertex, i$.$e$.,$ a vertex with no edge incident to it$.$