I need a solution to the following Python programming problem involving finding the max sum of an hour glass an 6*6 random array.

4. For a given array A, we define hourglass in A to be subset of values with indices falling in this pattern in A: [8, 1,6,6, ?, ?], hourglass a b c For a 6 6 dimensional array there are 16 hourglasses. Create a random 6*6 array using Import numpy as ngp array np.random.randint(6, size (6, 6)) Print the largest hour glass sum found in the array le. a+b+c+d+e+frg of all the 16 hourglasses In the above array, it is 7