Find an efficient algorithm to solve the following problem. Let G be a directed graph

1. In Lesson 3, we talked about the Tarjan algorithm (SCC algorithm). Now you are required to find an efficient algorithm to solve the following problem Let G be a directed graph where every node is labeled with a color. Many nodes can share the same color. Let v1, v2,Vz be three distinct nodes of the graph (while the graph may have many other nodes besides the three). I want to know whether the following items are all true: there is a walk from v to v2 and a walk B from v to v such that a is longer than ; contains only red nodes (excluding the two end nodes); . contains only green nodes (excluding the two end nodes). 1. In Lesson 3, we talked about the Tarjan algorithm (SCC algorithm). Now you are required to find an efficient algorithm to solve the following problem Let G be a directed graph where every node is labeled with a color. Many nodes can share the same color. Let v1, v2,Vz be three distinct nodes of the graph (while the graph may have many other nodes besides the three). I want to know whether the following items are all true: there is a walk from v to v2 and a walk B from v to v such that a is longer than ; contains only red nodes (excluding the two end nodes); . contains only green nodes (excluding the two end nodes)