$3$ Find the shortest path tree rooted at $s$ for the graph depicted below by applying Djikstra's algorithm using the format $v(j)[pred(j)],$ give the minimum cost path label of each node, as specified by the shortest path tree rooted as $s$ described in the problem statement. To get you started, the label at node $s$ is $0[0].(3$ points$)$