Q$1)-$ Consider the network in the following figure: $($a$)$ Find the shortest path between node a and all other nodes using Dijkstra algorithm $($b$)$ Using the results of part $($a$),$ plot the corresponding graph $($tree$)$ that represents the shortest path from node a to other nodes