Cpt S 350 Homework #7 Please print your name! Let G be color graph in the sense that it is a dorected graph where each node has a color. In particular, there is a designated initial node. An w-path is 1. Design an algorithm that decides where there is an w-path on which 2. Design an algorithm that decides where there is an w-path on which an infinite walk on G that starts from the initial (yellow Vblue) holds. DG(yellow blue) holds Cpt S 350 Homework #7 Please print your name! Let G be color graph in the sense that it is a dorected graph where each node has a color. In particular, there is a designated initial node. An w-path is 1. Design an algorithm that decides where there is an w-path on which 2. Design an algorithm that decides where there is an w-path on which an infinite walk on G that starts from the initial (yellow Vblue) holds. DG(yellow blue) holds