4. This problem has nothing to do with the material covered in class or textbook. But, it is an algorithm-design problem that is asked sometimes in job interviews. I will occasionally assign problems of this type for homework to get you to practice "algorithmic thinking" in general 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 7 exist. Your task is to describe an O(n) time algorithm for this problem and then present a brief ent as to wW