Assume a modification of the divide and conquer solution where the right recursive call is always omitted. Provide a very basic example array where the modified algorithm would fail. Also explain why?

give a example that would make the algorithm fail where the left recursive call is always omitted

give an example that would make the algorithm fail where the find-max-subarray call is always omitted