$7.$ You have a graph which is undirected and connected with n vertices. If it has n edges, it

a$)$ cannot contain a cycle b$)$ must contain a cycle

c$)$ may contain multiple cycles d$)$ none of these