A graph algorithm with $($ ElogV $)$ running time is asymptotically better than an algorithm with a $($E log E$)$ running time for a connected, undirected graph $G(V,E).$

The above statement is TRUE because in a connected graph E $\frac{V^2}{2}$

The above statement is FALSE because in a connected graph $E\frac{V^2}{2}$

The above statement is TRUE because in a connected graph $E\frac{V^2}{2}$

The above statement is FALSE because in a connected graph $E\frac{v^2}{2}$