Recall the winner problem from HW 1: An array is called a winner if it has two entries which together add up to a third entry, i.e. if A[i] + A[j] = A[k] for some i, j, k , where i+juk. You may assume all values in A are >0. a. Write an algorithm (pseudocode preferred) to determine if A is a winner that starts by sorting A. (2.5 points) b. Explain the running time of your algorithm using Big-O notation. (2.5 points) c. Write an algorithm (pseudocode preferred) to determine if A is a winner that uses a hash table. (2.5 points) d. Explain the running time of your algorithm using Big-O notation. (2.5 points) Recall the winner problem from HW 1: An array is called a winner if it has two entries which together add up to a third entry, i.e. if A[i] + A[j] = A[k] for some i, j, k , where i+juk. You may assume all values in A are >0. a. Write an algorithm (pseudocode preferred) to determine if A is a winner that starts by sorting A. (2.5 points) b. Explain the running time of your algorithm using Big-O notation. (2.5 points) c. Write an algorithm (pseudocode preferred) to determine if A is a winner that uses a hash table. (2.5 points) d. Explain the running time of your algorithm using Big-O notation. (2.5 points)