Consider the problem of finding a shortest path from the origin 1 to a single destination t, subject to the constraint that the path includes a given node s. Show how to solve this problem using the single origin/single destination algorithms of Section 2.5