Consider the following statements:

(i). Any comparison based sorting algorithm requires \(\Omega(nlogn)\) swaps.

(ii). If all edge weights of an undirected connected graph are either 0 or 1, then shortest path between any two nodes can be found in \(O(E)\) time, where \(E\) is the number of edges in the graph.

Which of the above statement/s is/are TRUE?