Question 6: One Edge, Two Edge, Red Edge, Blue Edge Let G(V, E) be an undirected graph with the additional property that every edge also has a color, either red or blue. Let u and v be distinct vertices in G(V, E). a) Design an algorithm that decides whether or not there exists a path from u to v such that the path contains only red edges. Justify correctness and running time. b) Design an algorithm that decides whether or not there exists a path from u to v such that within the path, all blue edges appear after all red edges . Justify correctness and running time