(a) Draw the shortest paths tree that starts at vertex s. Draw the minimum spanning

tree for the graph. Are there any differences?

(b) Draw the smallest possible graph (i.e. minimum number of vertices) for which

these two trees are different. Clearly label the vertex s, and explicitly show both trees on

your given graph.