Say that we are given a graph G$=($V $,$ E$)$ with n $=|$V$|,$ m $=|$E$|,$ and vertex degrees given by f

unction deg which represents the out$-$

degree in case that G is directed $($and is otherwise unambiguous for undirected G$).$

Which of the following statements is always true, regardless of the directed or undirected nature of G$?$

Select one:

$$ u belongs to V in degree$($u$)=\backslash$Theta $($n$^2)$

$$ u belongs to V in degree$($u$)=\backslash$Theta $($m$)$

$$ u belongs to V in degree$($u$)=\backslash$Theta $($n log n$)$

$$ u belongs to V in degree$($u$)=\backslash$Theta $($m log m$)$

$$ u belongs to V in degree$($u$)=\backslash$Theta $($n$)$