Q$2.$ Given an undirected graph G with n nodes and m edges, design an O$($m$+$n$)$ algorithm to

detect whether G contains a cycle. Your algorithm should output a cycle if G contains one. $(10$

points$)$