c$++$ complexity $-$ programmingLet A be an array of integers $($some integers can be negative$).$ Assume that the array size is n$.$ Thesubarray A$[$i$..$j$]$ is the part of the array that starts at index i and ends at index j$,$ where $0<=$ i $<=$ j $<=$ n$-1.$ Letsij equal the sum of the integers in A$[$i$..$j$].$You are to solve the following problem:Find the maximum value for s ij over all subarrays in array A$,$ where $0<=$ i $<=$ j $<=$ n$-1.$