Question $2$:

$($A$)$ Write a Depth First Search $($DFS$)$ algorithm that takes a directed graph $($represented as an adjacency list$)$ and then returns whether the graph includes cycles $($loops$)$ or not.

The image below shows the difference between cyclic and acyclic graphs:

r$...$lli$-$ remun Acyclic Graph

N$.$B: you can search online and use an already existing class implementation of a graph as an adjacency list.

$($B$)$ Modify the code in the previous question to work on an undirected graph $($represented as an adjacency matrix$).$USE JAVA PLEASE!