Let P be a problem. The worst-case time complexity of P is O (n^2). The worst-case time complexity of P is also Ohm (n log n). Let A be an algorithm that solves P. Which subset of the following statements are consistent with this information about the complexity of P? Justify your answer. (a) A has worst-case time complexity O (n^2). (b) A has worst-case time complexity O (n^3/2) (c) A has worst-case time complexity O (n). (d) A has worst-case time complexity theta (n^2). (e) A has worst-case time complexity theta (n^3)