Each of these cod fragments takes if O(n log n) time, but not necessarily omega(n log n). Give the asymptotic complexity of each in terms of n, using omega in each case.

4. Each of these code fragments takes if O(n log n).time, but not necessarily O(n log n). Give the asymptotic complexity of each in terms of n, using e in each case. (a) for (int i - 1; i 1; i=i/2) i; j > 1; j--); for (int j cout 1; i=i/2) n; j > i; j--); for(int j cout