Let G = (V, E) be a directed graph. Let v V and u V be two different vertices in V . Design an algorithm that determines if there exists a path from v to u that contains a (non-empty) cycle. Prove the correctness of your algorithm. Analyze its worst-case running time.