Given a directed graph G= (V; E) with nonnegative edge weights and the shortest path distances d(s; u) from a source vertex s to all other vertices in G. However, you are not given the shortest path tree. Devise a linear time algorithm, to find the shortest path from s to a given vertex t.