Tim's fаvоrite cоffee shоp hаs closed due to the tough economy. Now he hаs to find a new coffee shop on his commute to work. To simplify the problem, you are given a list of intersections V and directional roads E. All intersections in V are reachable from any intersection. All roads e have a w(e) indicating its length. You are also provided with a list of intersections C, such that c ∈ C is an intersection that is close to exactly one coffee shop. Design an algorithm to produce a path from Tim's home (s) to Tim's work (t) such that at least one c ∈ C is along the path. We want the shortest path that qualifies. Ungraded: Recommend your favorite (real life) coffee shop to Tim.