Given an array of integer numbers, write an linear running time complexity program in Java to find the stability index in it. For an array A consisting n integers elements, index i is a stability index in A if A[0] + A[1] + ... + A[i-1] = A[i+1] + A[i+2] + ... + A[n-1]; where 0 < i < n-1. Similarly, 0 is an stability index if (A[1] + A[2] + ... + A[n-1]) = 0 and n-1 is an stability index if (A[0] + A[1] + ... + A[n-2]) = 0 Example: Consider example, consider the array A = {0, -3, 5, -4, -2, 3, 1, 0}. The stability index found at index 0, 3 and 7.