need help asap

IX. (15 points) T/F (a) Both the worst-case and the average-case complexity functions for Binary Search are in (b) For Sequential Search the best-case complexity function B(n) -0. (c) For Merge Sort the best-case, worst-case, and average-case complexity (log n). T/F T/F functions are in (nlog n) (d) In Merge Sort the maximum number of comparisons required to merge two arrays of size n/2 into an array of size n is (n-1). T/F T/F (e) A complexity function for an algorithm maps the number of basic operations required for an input of size n into n