Use the array component assignment axiom (two times) to find the most general sufficient pre-condition P for the following code fragment: ASSERT(P)/* determine what is P */ A[j] = 3; = A[k] = x+2; ASSERT A[m] > A[k] ) Above A is an array of integers, x is an integer variable and we assume that all the subscripts are within the range of subscripts for A. Write the assertion P first using the notation from the array-component assignment axiom, and then rewrite P in a logically equivalent form that does not contain any notation (A | | +-> E). Show your work