I need help on this question. Please provide the solution with explaination. Thank you!

Let G be a decorated graph. That is, each edge in G is labeled with a color drawn from a finite set C. Let v and v' be two given nodes in G. Design an algorithm that answers the following question: is it true that, for every path (a path could contain loops) from v to v', the number of red edges is greater than the number of green edges