6. Let G = (V, E) be a simple undirected graph. Provide an algorithm running in O(V + E) time, which outputs whether G contains a cycle or not. If it contains a cycle then it needs to output at least one cycle. What graph representation you have used for your algorithm. Justify why you used that and remember to link this justification with your complexity analysis