Let G = (V,E) be a directed graph. Each edge has a weight, which is a non-negative number, and a color, which is either red, white, or blue. Let s,t V. A path from s to t is called patriotic if it starts with a sequence of one or more red edges, followed by a sequence of one or more white edges, and ends with a sequence of one or more blue edges. Your task is to design an efficient algorithm that finds a patriotic path fro s to t of minimum weight (or reports that there is no patriotic path). Your algorithm should run in time O((VEDlogV|). Solve this by reduction to a standard single source shortest path problem Let G = (V,E) be a directed graph. Each edge has a weight, which is a non-negative number, and a color, which is either red, white, or blue. Let s,t V. A path from s to t is called patriotic if it starts with a sequence of one or more red edges, followed by a sequence of one or more white edges, and ends with a sequence of one or more blue edges. Your task is to design an efficient algorithm that finds a patriotic path fro s to t of minimum weight (or reports that there is no patriotic path). Your algorithm should run in time O((VEDlogV|). Solve this by reduction to a standard single source shortest path