Given an array that contains n integers that could be positive, negative, or zero, return the product returned by the subarray with the maximum product (Full Question) The problem is similar to the Maximum sum Subarray Problem Brute force would be to iterate through the array with two pointers i…