Q$1.$ Detecting a Cycle in the given Directed Groph

Given a Graph with V vertices $($Numbered from$0$to V$-1)$ and E edges, Task is to check whether it contains any cycle or not.

Cycle: A cycle in a graph is a path that starts andends at the same vertex with at least one other vertex in between, and no edges are repeated.

give the answer in pyjhon progaamming language

Example:

Input:

Output: Cycle is Found