true or false

1. (6 points) Asymptotic Complexity. Circle True or False below. a) (1') The worst case running time of Quicksort is O(NlogN). b) (1') The best case runtime for a merge operation on two subarrays (both N entries ) is O(logN). c) (1') The run time for deletemin operation on a min-heap ( N entries) is O(N). d) (1') The best case run time for insertion sort for a array of N entries is O(NlogN). e) (1') The run time for erasal of the tail node in a linked list is O(1). f) (1') If T1(N)=O(f(n)) and T2(N)=O(f(n)), then T1(N)=O(T2(N))