1) Use Link State algorithm to determine the shortest path from node D to all other nodes. Be sure to show all intermediate steps using notation from class. 2) Use Distance Vector algorithm to update the given routing table of Node C where it gets neighbors node F and G routing tables in the given order. 3) Distance Vector Routing protocol may cause oscillations. True False 4) Routing Information Protocol (RIP) is considered secure since it uses TCP to exchange information. True False 5) We can use link-state or distance-vector routing protocol for internet as a whole. True False 6) In Mobile IP, Packets must go back to Home network before reach to remote host if a mobile user send a packet to a remote host. True False 7) Simple Round-robin is based toward larger packets. True False 8) In a switch fabric, you can route two input ports to the same output port at the same instant. True False 9) Dynamic Host Configuration Protocol (DHCP) is used to obtain dynamic IP address. True False 10) If a packet is fragmented a router, it must be reassembled back by the next router: True False a. The weighted graph.