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 ijk.

a)Write an algorithm (pseudocode preferred) to determine if a given array A is a winner. Your algorithm should not use any additional data structures.

b)Analyze the running time of your algorithm using Big-O notation.