Given below is information about a network. Choose one of the following three options: the network is definitely a tree; the network is definitely not a tree; the network may or may not be a tree (more information is needed). Accompany your answer with a brief explanation for your choice. The network has eleven vertices, no loops, and no multiple edges, and has two vertices of degree 11 and nine vertices of degree 22.
A. The network may or may not be a tree because the number of bridges is unknown.
B. The network is definitely a tree because it satisfies the N+1 edges property since it has 11 vertices and 10 edges.
C. The network may or may not be a tree because the number of edges is unknown.
D. The network is definitely not a tree because it violates the N−1 edges property since it has 11 vertices and 10 edges.
E. The network is definitely not a tree because it violates the single-path property. F. The network is definitely a tree because it satisfies the N−1 edges property since it has 11 vertices and 10 edges.