Multiple choice answers needed Java ! Thanx

What should the Big-O behavior of the sort(String) method be in the average case? Group of answer choices O(log N) O(N3) O(1) O(N2) O(N) O(N log N) Flag this Question Question 91 pts What should the Big-O behavior of the insertionSort(T[), Comparator) method be in the average case? Group of answer choices 0(1) O(logN) O(N2) O(N3) O(N) O(N log N) Flag this Question Question 101 pts What should the Big-O behavior of the areAnagrams(String, String) method be in the average case? Group of answer choices 0(1) O(N) Odlog N) O(N log N) O(N2) O(N3) Flag this Question Question 111 pts What should the Big-O behavior of the getLargestAnagramGroup(String[]) method be in the average case? Group of answer choices O(1) Odlog N) O(N) O(N2) O(N3) O(N log N) Flag this Question Question 121 pts Instead of writing the sorting method for strings as String sort(String), we could simply write void sort(String)and modify the value of the method's parameter instead of returning a string. Group of answer choices True False 12:15 nm