Part 1. Problem Statement: Given an array of integers A and an integer m, determine the maximum product of m consecutive integers in the array. Example: A = [3, 1, 6, 2, 8, 9, 3, 4], m = 3 Answer: 216 (which is the product of 8, 9, and 3) Guidelines: Implement your solution in a class called Part1.java with the following method signature: o public static int maxProduct (Array a, int m) The method takes the Array and the integer and returns the maximum product. You are not allowed to use any additional data structures. For full credit, your solution should be no worse than O(N+M) where N is the number of elements in A and M is m. You might also want to reduce the constants in front of those as much as possible because a solution that is O(N+M) could still include some inefficient things.