Question 2 (2.14 points) Adding an additional edge to a spanning tree would produce O 1) a loop 2) a redundant path ( 3) a cycle O 4) all of the above Question 3 (2.14 points) A search which starts at the root of the tree and bears left is the strategy. O 1) postorder ( 2) preorder ( 3) inorder Question 4 (2.15 points) Consider the cities . The costs of the possible roads between cities are given below c(C,E)-11 c(C,F)-12 c(C,G)-14 c(D,G)-13 c(E,H) 15 c(F,H)-16 c(G,H)-17 What is the minimum cost to build a road system that connects all the cities? ( 1) 65 2) 66 ( 3) 61 ( 4) 63Question 5 (2.14 points] Spanning trees are used in computer networks to assure _____ . O 1) there are no cycles or loops 0 2} all computers are available on the network 0 3} a minimum number of links are used 0 4} all of the above Question 6 (2.14 points] A spanning tree must connect nocles _____ . O 1} from top down 0 2} with a minimum number of edges 0 3} from bottom up 0 4) symmetrically Which of the following are trees? O1) P T 0 U H H 02 I L H P N G F H I J H