Algorithm Analysis Consider a directed graph G, where each edge is colored either red, white, or blue. A walk in G is called a French flag walk if its sequence of edge colors is red, white, blue, red, white, blue, and so on. More formally, a walk v0 → v1 → ... → vk is a French flag walk if, for every integer i, the edge vi →vi+1 is red if i mod3=0, white if i mod3=1, and blue if i mod3=2. Describe an efficient algorithm to find all vertices in a given edge-colored directed graph G that can be reached from a given vertex v through a French flag walk.