ou are given a simple directed graph G with vertex set V $,$ edge set E and vertex labels

L$($v$)$ in $\{0,1\}$ as well as a starting and ending vertex s$,$ t$.$

Design a reasonably efficient algorithm that determines if there is a walk from s to t that goes through

exactly two $0$ vertices.