(10%) Given a directed and strongly connected graph $G = (V, E)$, please design an algorithm to determine whether it contains a (directed) cycle of odd length.