You are traveling in a spaceship that can go between stars (vertices) using fuel to do so (edge weights). The stars are represented as a weighted directed graph G = (V, E, w) with positive edge weights where each edge represents a travel route between stars in G. Sometimes you encounter a spacetime conduit connecting two stars. The conduit allows instantaneous travel without the use of fuel, i.e., a zero-weight edge. Star-command regulations only allow you to use a maximum of one conduit during your journey. We define a Boolean function C[e] for each edge e in E. C[e] is True if edge e is a spacetime conduit and False otherwise. Give an efficient algorithm to find the shortest (minimum-weight) path between two designated stars s and t in G that does not use more than one spacetime conduit. Assume that G is in adjacency list format. Your algorithm should have the same asymptotic running time as Dijkstra's algorithm. Hint: modify the graph G. 6 points) Describe your algorithm in pseudocode. Comment your code. Modifications of the graph must be described in pseudocode