Algorithm analysis

3 A researcher claims that he has .1 developed a general-purpose sorting algorithm based on comparing pairs of elements with worst-case running time O(n*log(sqrt(n))). Does this claim contradict the theoretical lower bound, taking into account that sqrt(n) ?= O(n) but not vice versa Yes, this claim contradicts the theoretical lower bound. No, this claim is consistent with the theoretical lower bound