Perform Depth First Traversal and Breadth First Traversal in the following graphs.

Also specify the discovery$-$time and finish$-$time of all the nodes for DFS$.$

$9.$ Modify the Depth$-$First Traversal algorithm to detect cycles in a graph