9. Colorful paths (11). You are given a directed graph -(yE), and nodes s, t. odes are colored red, yellow, blue, or white. A path (not necessarily simple) is called k-colorful if it runs from s to t and contains at least k red nodes, k yellow nodes, and k blue nodes (counting any repetitions of nodes). G is called dazzling if there is a k-colorful path for every k > 0. Design and analyze an algorithm to determine if G is dazzling. Your algorithm should run in time OVI EI) Hint: use a standard algorithm as a subroutine. 9. Colorful paths (11). You are given a directed graph -(yE), and nodes s, t. odes are colored red, yellow, blue, or white. A path (not necessarily simple) is called k-colorful if it runs from s to t and contains at least k red nodes, k yellow nodes, and k blue nodes (counting any repetitions of nodes). G is called dazzling if there is a k-colorful path for every k > 0. Design and analyze an algorithm to determine if G is dazzling. Your algorithm should run in time OVI EI) Hint: use a standard algorithm as a subroutine