Upon termination of Dijkstras algorithm on a connected graph g, if we keep only the nodes and the edges that connect nodes to their parents, we obtain a tree. For an arbitrary connected graph g and node i in it, is the tree produced by the algorithm on g, starting from node i, a spanning tree? Is it a minimum spanning tree? Prove your answer.