Problem 3. Consider the following problem: Given: an unsorted array A of n-1 distinct integers from the range 1 to n, find the missing integer. Example: A = [5, 1, 3, 4]. The answer: 2 is missing Propose 3 different algorithms to solve this problems with running times O(n), O(nlogin)) and O(n2)