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 and alternates between 0 and 1 edges and outputs FALSE otherwise. (note: the path may start with a 0 edge or a 1 edge.)