B. (8pts) Is the shortest path tree computed at node E the same as the one computed at node C? Explain. Note: Two trees are the same when they contain exactly the same links. Hint: Compute the shortest paths from node E as above, until you find a path that's different from the ones computed from C. C. (5pts) What is the routing table for node C ? The routing table contains at least two columns: destination, and next-hop link / next-hop router. Explain how you got this routing table..