2D Java Array Problem

You are given a 6 6 2D array. An hourglass in an array is a portion shaped like this: a bc ef g For example, if we create an hourglass using the number 1 within an array full of zeros, it may look like this: 1110 0 0 1000 11100 e Actually, there are many hourglasses in the array above. The three leftmost hourglasses are the following: The sum of an hourglass is the sum of all the numbers within it. The sum for the hourglasses above are 7, 4, and 2, respectively In this problem you have to print the largest sum among all the hourglasses in the array