Problem 3. Given an array A[1 : n] of a combination of n positive and negative integers, our goal is to find whether there is a sub-array A[l:r] such that A[i] = 0. ] i=1 Example. Given A = [13, 1, 2, 3, -4, -7,2, 3, 8, 9), the elements in A[2 : 8] add up to zero. Thus, in this case, your algorithm should output Yes. On the other hand, if the input array is A = [3, 2, 6, -7, -20, 2, 4], then no sub-array of A adds up to zero and thus your algorithm should output No. Hint: Observe that if i= A[i] = 0, then =1 A[i] =-(i=1 A[i]); this may come handy