OBLEM 5 (30 points) e False (circle one): T F a, fin)-5n2+3n + 2 is (n) T F b. fin) = 3n + 100 log n is O(n2) T F c. fin)-5n2 + 3n + 2 is (n) T F d. fin)-3n + 100 log n is (log n) T F f. Merge sort's best, average and worst case running times are the same. g. Quick sort is an inplace and stable sorting algorithm. e Th e running time of insertion sort in backward sorted input is O(n). F TF onsider a Quick sort implementation where we first find median using this algorithm, then use median as pivot. The worst case time complexity of this modified Quick sort will be O(nlogn). TF h. Suppose we have a O(n) time algorithm that finds median of an unsorted array. Loop invariants can be used to show both the correctness of the algorithms and their efficiency TF. At a moment during the runtime of the insertion sort, if one sees the array looks like