10) Consider the network shown below. N W 3 8 z) 2 ED 8 (a) Using the distance vector algorithm, what will be the distance vectors at node U before receiving any update from its neighbors? After that, suppose that node U receives distance vectors from its neighbors and updates its distance vector. What will be the distance vectors at node U after taking into account the performed computation? Format your answer as a table. (6 marks) (b) Using the Dijkstra's algorithm, compute the least-cost paths from U to all other nodes. Show all your steps. In your steps, you need to write down the cost from U to each node and the predecessor node along the path from U to each node. Format your answer as a table. (7 marks)