Let $T_{st}(G)$ be the worst$-$case time complexity to use Dijkstra's algorithm for computing a

shortest path from a given source vertex to a given destination in a directed graph $G.$ Let

$T_s(G)$ be the worst$-$case time complexity to use Dijkstra's algorithm for computing a

shortest path from the given source vertex to all reachable vertices in the graph. Which of

the following correctly describes the relationship of $T_{st}(G)$ and $T_s(G)?$

$T_s(G)=(T_{st}(G))$

$T_s(G)=(n{T}_{st}(G))$ where $n$ is the number of vertices in graph $G.$