Points: U of 1 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 eight vertices, no loops, and no multiple edges, and every vertex has degree 2 . . . Choose the correct answer below. O A. The network is definitely a tree because it satisfies the single-path property O B. The network is definitely not a tree because it violates the N + 1 edges property since it has 8 vertices and 8 edges O C. The network may or may not be a tree because the number of edges is unknown. O D. The network is definitely a tree because it satisfies the N + 1 edges property since it has 8 vertices and 7 edges O E. The network is definitely not a tree because it violates the N - 1 edges property since it has 8 vertices and 8 edges OF. The network may or may not be a tree because the number of bridges is unknown. O G. The network is definitely a tree because it satisfies the N - 1 edges property since it has 8 vertices and 7 edges