Question 1. (5 points) If the merging algorithm used in mergesorting is implemented inefficiently and makes N log N comparisons rather than N, then the time complexity of the resulting mergesort would be (choose the best answer) 1. O(N log(log N))) 2. O(Nlog N) 3. O(N log N log(log N)) 4. O (N(log N 5. O(N(log(log N))2) )2) Question 2. (5 points) If the merging algorithm used in mergesorting is implemented inefficiently and makes NvN comparisons rather than N, then the time complexity of the resulting mergesort would be (choose the best answer) 2. O(NVN log N) 3. O(N2) 4. O(N2 log N) Question 1. (5 points) If the merging algorithm used in mergesorting is implemented inefficiently and makes N log N comparisons rather than N, then the time complexity of the resulting mergesort would be (choose the best answer) 1. O(N log(log N))) 2. O(Nlog N) 3. O(N log N log(log N)) 4. O (N(log N 5. O(N(log(log N))2) )2) Question 2. (5 points) If the merging algorithm used in mergesorting is implemented inefficiently and makes NvN comparisons rather than N, then the time complexity of the resulting mergesort would be (choose the best answer) 2. O(NVN log N) 3. O(N2) 4. O(N2 log N)