Given an undirected graph with $V$ vertices labeled from $0$ to $V-1$ and $E$ edges, check whether it contains any cycle or not. Graph is in the form of

adjacency list where adj$[$i$]$ contains all the nodes $i^{th}$ node is having edge with.

i$)$ Input:

$V=5,E=5$

adj$=\{\{1\},\{0,2,4\},\{1,3\},\{2,4\},\{1,3\}\}$

ii$)$ Input:

$V=4,E=2$

adj$=\{\{\},\{2\},\{1,3\},\{2\}\}$