Q$4.(15$ points$)$ Use Dijkstra $\text{'}$s algorithm to Determine the shortest paths from the node $\backslash ($ A $\backslash ).$ to all other vertices in the following graph. Compute the functions $\backslash ($ D $\backslash )$ and $\backslash ($ P $\backslash )$ for each node and then compute the shortest route for each noQ$4.(15$ points$)$ Use Dijkstra $\text{'}$s algorithm to Determine the shortest paths from the node $A$ to all other vertices in the following graph. Compute the functions $D$ and $P$ for each node and then compute the shortest route for each node.de$.$