Complexity and Problem-Solving Strategy Question 12 (a) Say you have two sorting algorithms to compare and your goal is to select one of them to be used in a real-time application. Algorithm 1 has a worst case time complexity of O(n2), while algorithm 2 has a worst case time complexity of O(nlogn). Both have worst case space complexity of O(n). Which one would you say is a better sorting algorithm (1 or 2) for a real-time application? Briefly justify your answer. 13 marks] (b) State in one sentence the essence of the P versus NP problem. [2 marks]