You are given a sorted list L of numbers (say, sorted in increasing order). The problem is to find two indices i and J, J such that L[i] + LLi] 0. Of course, it is possible that no such i and j exists (e.g., if all elements in L are positive). In that case, the output should indicate that no such i and j exist O(n) time algoithmfor this problem and then present argument as to why this algorithm runs in O(n)time