QUESTION 10 Chapter 4. Broadcast and Multicast RI RI R1 Spanning Tree (SP3) 5 5 Figure (FO) Spanning Tree (SP1) Spanning Tree (SP2) R2 5 R2 R2 R2 15 20 20 15 20 15 2 2 R4 R3 R3 R4 R3 R4 R3 Consider the network graph in the Figure above (FO). o Is the graph in FO a spanning tree? Choose Yes or NO ( ) Why?( ) ) o What is the total number of possible spanning trees that can be created for the graph FO? Choose a number ( ) o Which of the figures represent a Steiner tree? Choose the appropriate figure ) What is the total cost of the steiner tree? Choose the correct cost ( ) o Which of the broadcast approaches uses spanning trees? Choose the correct broadcast approach ( o Which of the multicast approaches uses spanning trees? Choose the correct multicast approach ( ) o Which of the following Internet Multicast Protocols uses spanning tree? Choose the appropriate protocol or None-of-the-given-options ) 8 Please answer the questions above, from the following options: YES Y NO It not a tree It has a cycle some of its nodes are not connected None of the given options 2 3 4 S 5 22 27 40 SP1 SP2 SP3 FO Source duplication In-network duplication Source-based tree Group-shared tree DVMRP PIM Thank you