Q4 Assume a sorting algorithm S sorts a file containing n items in best-case time bin)n+5 steps and worst-case time w(n) 3n * ln(n) + n steps. True or false (give a reason) (a) b(n) is O(w(n)) (b) b(n) is not (w(n)) c) A sorting algorithm T with worst-case time function ur (n)-.1n2 will be more efficient (use less time/steps) than S does for large values of n (d) w(n) is (n1.5)