Write a method that returns the greatest sum of two "adjacent" integers in an array. To be adjacent the two integers must be positioned next to each other in the array. Note that it is possible for the greatest sum to NOT involve the greatest number in the array. For example, the array {4, 5, 70, 3, 40, 35, 2, 1} has a greatest sum of 75. If the array has less than two elements, return zero. Restrictions: You are NOT allowed to use any of the "Math." methods. You are also NOT allowed to use ArrayLists. You are NOT allowed to assume a particular maximum or minimum initial value, not even maxInt or -maxInt!!!