Describe an algorithm that takes an Undirected Graph G and 2 vertices s and v as inputs, and prints out a shortest path going from s to v in G. Use pseudocode or English (not C),but your algorithm should be clear and efficient.

What is the complexity of your algorithm for finding the shortest path from s to v? Give an answer involving n (number of vertices in G) and m (number of edges in G) that will be good even if the graph is sparse.