Question $5$:

Let $T$ be a tree constructed by Dijkstra's algorithm in the process of solving the single$-$source shortest$-$path problem for a weighted connected graph $G.$

a$.$ True or false: $T$ is a spanning tree of $G?$

b$.$ True or false: $T$ is a minimum spanning tree of $G?$