E Homework: Chapter 7 HW

Homework: Chapter 7 HW Question 8, 7.1.22 points O Points: O ofl Save Gwen below is information about a network Choose one of the following three options the network is definitely a tree, the network rs definrtely not a tree, the network may or may not be a tree (more Information rs needed) Accompany your answer With a bnef explanation for your chore The network has fourteen vertices, no loops, and no multiple edges, and has su vertices of degree 3 and euht vertices of degree 1. Choose the correct answer below ) oc. The network may or may not be a tree because the number of bndges is unknown The network 's definitely not a tree because it mates the sngie-path property The network IS defrnrtely not a tree because it votes the N - 1 edges property srnce it has-14 vertices and 13 edges The network is definitely a tree because 't satisfies the N + 1 edges property stnce it has 14 vertres and 13 edges The network rs definitely a tree because it satisfies the N - I edges property srnce it has 14 vertices and 13 edges The network may or may nol be a tree because the number of edges IS unknown Incor