Please solve the graph question in detail and clear.

Question 4: Testing if an undirected graph is acyclic You are given a strongly connected, undirected graph G with n vertices as an adjacency list. Write an algorithm to check if G has a cycle that runs in time O(n). Hint A connected, undirected acyclic graph is a tree. Since you are already given that G is connected, you are just checking if G is a tree. How many edges would a tree have? YOUR ANSWER HERE