Let G be an undirected graph where the vertices are colored with either red or blue. Give a source vertex s, the problem is to find a path with the maximum number of red vertices. Write an efficient algorithm for the given problem, briefly describe why it is a correct algorithm, and analyze the time complexity. If you cannot find any polynomial-time algorithm, then give a backtracking algorithm.