(a) Using Dijkstra's algorithm, compute the shortest path from LA to NY in the following network: 65 79 102 93 90 NY LA 66 59 /96 180 65 (b) Using Dijkstra's algorithm, compute the shortest path from node (b) to NY in the network of 37(a) above.

(a) Using Dijkstra's algorithm, compute the shortest path from LA to NY in the following network: a 65 79 102 93 d 70 90 64 NY LA b 66 459 64 C 96 80 65 82 13 74 h (b) Using Dijkstra's algorithm, compute the shortest path from node (b) to NY in the network of 37(a) above