1.4a Formally specify an array problem** Using the languages of predicate logic (with quantifiers, if appropriate) and algebra, give the formal postcondition for an algorithm (but not the algorithm itself) that accepts an array A, or arrays A and B, and returns value y as stated below. 3. y= true iff a. A consists of alternating 0 s and 1s b. A has no pair of adjacent elements that are the same c. every element in A after the second is the sum of the previous two d. all elements of A are the same e. at least two adjacent elements of A differ f. at least two elements of A are the same g. every element of A after the second matches the element that is two elements to its left h. the first element is the smallest i. at least two adjacent elements are the same j. not all elements are the same