this is a computer networks question. THIS IS THE CONTINIOUS QUESTION. I NEED SOLUTION TOGETHER BECAUSE I NEED TO UNDERSTAND.

8. Consider the network given in the following figure. B 2 4 D 3 1 4 T7 1 5 2 G on E 5 2 3 5 K a. Imagine that a Link State Routing is used based on Dijkstra's Algorithm. Describe the contents of the Link State Packets built at routers F, G, A and H. b. Calculate the sink tree formed by applying Dijkstra's algorithm based on router G. Specify the contents of routing table for router G. c. If we would like to implement hierarchical routing, what would the contents of routing table for router G be now? Assume that routers, A, B, E and F are in region 1. C, D, G, H, K and L are in region 2 and I and I are in region 3. d. Assume that routers A, F, G, K and L are members of a group and router G wants to multicast some information to this group. What is the multicast tree for this group based on router G? e. Assume that we would like to implement reverse path forwarding based on router G. What is the corresponding tree for reverse path forwarding? How many packets are generated by a broadcast from node G if reverse path forwarding is used and if the sink tree is used