big Oh practice T/F problems

For each of the equations below, answer T(rue) or False). If you answer is F, then provide one sentence to justify your answer. a) 3n+ 10 O(n) b) n log n + 100n = O(n) c) n log n + 100n = O(n) d) n" + log n = O(log n) e) n log n+ n = O(n) f) 10^n+ n log n= On) g) MergeSort has best-case time complexity of O(n). h) InsertionSort make no more than O(n log(n))) pairwise comparisons. i) Finding the middle element in a singly linked list is O(n). j) Worst case complexity of Quicksort is O(n log n)