Question #1 (21 points) In class, we discussed a divide-and-conquer solution for finding a maximum sub- array. Provide clear, concise answers to each of the following related questions. (7 points). Assume a modification of the divide-and-conquer solution in which the right recursive call is always omitted. Provide the most basic example array for which the modified algorithm would fail. (7 points). Assume a modification of the divide-and-conquer solution in which the left recursive call is always omitted. Provide the most basic example array for which the modified algorithm would fail. (7 points). Assume a modification of the divide-and-conquer solution in which the Find-Max-Crossing-Subarray call is always omitted. Provide the most basic example array for which the modified algorithm would fail. Question #1 (21 points) In class, we discussed a divide-and-conquer solution for finding a maximum sub- array. Provide clear, concise answers to each of the following related questions. (7 points). Assume a modification of the divide-and-conquer solution in which the right recursive call is always omitted. Provide the most basic example array for which the modified algorithm would fail. (7 points). Assume a modification of the divide-and-conquer solution in which the left recursive call is always omitted. Provide the most basic example array for which the modified algorithm would fail. (7 points). Assume a modification of the divide-and-conquer solution in which the Find-Max-Crossing-Subarray call is always omitted. Provide the most basic example array for which the modified algorithm would fail