8. Patriotic paths. 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 EV. 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 from s to t of minimum weight (or reports that there is no patriotic path). What is the running time of your algorithm, stated in terms of n F? := VI and m := 1 Hint: use standard algorithms as subroutincs. 8. Patriotic paths. 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 EV. 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 from s to t of minimum weight (or reports that there is no patriotic path). What is the running time of your algorithm, stated in terms of n F? := VI and m := 1 Hint: use standard algorithms as subroutincs