Problem
1. Describe a recursive algorithm that will check if an array A of integers contains an integer A[i] that is the sum of two integers that appear earlier in A, that is, such that A[i] = A[j] +A[k] for j,k > i.
2. Write a short recursive Java method that will rearrange an array of int values so that all the even values appear before all the odd values.