Consider the following network: Assume that at t=10 node 7 receives two LSA from node 4 regarding the link between nodes 1 and 4 (namely, LSA a. and LSA(b). LSA a has a sequence #242 and a cost=2, LSA b has a sequence #112 and cost=10. After processing, what will be the new cost of the link given that all nodes are using circular sequence numbers. Show the work, assume that an 8-bit field is used for sequence number. Node 7 does not receive any other LSA until t=15 where a new LSA c received from 4 with sequence #10, declaring the new cost for the link between nodes 1 and 4 being 3. No other LSA is received after that A. Find the route between nodes 7 and S1 at t=13. B. Find the route between nodes 7 and SI at t=16. C. Now assume that for some reason. Node 7 misses LSA b. What is the route between node 7 and SI at t=13 and t=16? Would this pose any issue? D. Assume that LSA a, LSA b. and LSA c are all received at the same time at t=10. Will router 7 face any issue finding its optimum route to S1 at t=13? Can the use of sequence numbers help find which of the three LSAs is most recent