Use Dijkstra's algorithm to find the shortest path tree and the forwarding table for node 1 in the network shown in Figure Q4. The number besides each link represents the cost of the link. You should clearly show the details in each iteration whern deriving the answer. No marks will be given for an answer without any steps Q4 (a) 2 4 15 40 10 50 20 20 60 50 Figure Q4 (10 marks) Suppose now the distance vector algorithm is used to build up the routing table of all routers for the network shown in Figure Q4. Determine the distance vector of node 2 after it receives the initial distance vectors from all its neighbors. You should clearly (b) show the details in each iteration when deriving the answer (5 marks) Suppose now the path vector algorithm is used to find out the best path for all routers shown in Figure Q4. Assume that the best path is the path which passes through the shorter list of nodes. Determine the path vector of node 7 after it receives the initial path vectors from all its neighbors. You should clearly show the details in each (c) iteration when deriving the