4. Consider the network shown below. Show the operation of Dijkstra's (link-state) algorithm in a table for computing the least cost path from D to all destinations. 10 5. How many subnets are there in the network below? Briefly explain your answer. Router Switch Switch 6. (True False)For each of the following statements, state if it is True or False: 6.1 In a distance-vector routing algorithm, each node has a map of the entire network and determines the shortest path from itself to all other nodes in the network. 6.2 OSPF uses BGP for routing among areas. 6.3 In the BGP routing algorithm, each AS advertises to its neighbors its 6.4 A gateway router must run both an intra-AS routing algorithm and an inter-AS 6.5 The network portion of an IP address is the same for all the hosts on the estimates of the shortest distances from the AS to all possible destination ASs routing algorithm. same IP network