3) For the 6-node network shown in the Figure below, the numbers associated with the links indicate the message delay (in seconds) over the link, with the arrow indicating the traffic directions. a) Apply Dijkstra's shortest path algorithm (Algorithm A) to obtain the shortest path tree for node 1. b) If in the next delay measurement cycle, only the link connecting node 2 to node 4 had a delay increase of additional 3 seconds. Using ARPANET modified Dijkstra's algorithm, obtain the new modified shortest path tree for node 1 and the corresponding delays. 1 2 2 3 3 3 3 5 3 4 7 5 34 2 2 6 ເມ 3