1. Suppose that you want to get from vertex s to vertex t in an unweighted graph G = (V, E), but you would like to stop by vertex u to eat ice-cream. Describe an efficient algorithm that would determine an optimal s-t path given your preference for stopping at u along the way. S t