3 Give Efficient Algorithm Takes Input Directed Graph G V E Edges Labeled Either 0 1 Verti Q37065926

3. Give an efficient algorithm that takes as input a directed graph G (V, E) with edges labeled with either 0 or 1, and vertices s and t that ouputs TRUE if and only if there is a path (not necessarily simple) that goes from s to t such that the binary sequence of edges in the path avoids the substring “1 and outputs FALSE otherwise. (For example, the string 10100010 avoids

OR

 

OR