Let undirected graph G $=($V $,$ E$)$ be such that G has no cycles: It is an acyclic undirected graph, and hence a tree.

Assuming that m$=|$V$|$ and m $=|$E$|$

$,$ which of the following correctly expresses the size

of the edge set of the tree G

$?$

Hint: Recall that any undirected tree may be represented programmatically by a rooted tree such that every non$-$root vertex has a unique parent$($so that every edge of the tree occurs between child and parent$)$ and only the root has no parent.

Select one:

a$.$m $=\backslash$Theta $($n log n$)$

b$.$None of the options

c$.$m $=\backslash$Theta $($n$)$

d$.$m $=\backslash$Theta $($n$^2)$

e$.$m $=\backslash$Theta $(1)$