Assume you have the following adjacency matrix representing a graph:
[1, 1,-1]
[1,-1,-1]
[-1,-1,-1]
Which of following can be concluded about the graph?
A. It is a disconnected undirected graph with loops
B. It is a connected graph with loops
C. It is a disconnected graph without loops
D. It is a disconnected graph with loops
E. It is an undirected graph