1.Prove that the following algorithm is correct for allarrays with at least 1 element. Note that [x] represents the floorfunction, which returns the largest integer less than or equal tox.
E.g., [2:8] = 2.
![Input: data: array of n integers Input: n: size of data Output: 〉 data[i] 1 Algorithm: RecursiveSum 2 if n- 1 thern 3return data[1] 4 else mid - In/ 6return RecursiveSum(data[1..mid]) + RecursiveSum(datamid 1..n])](http://d2vlcm61l7u1fs.cloudfront.net/media%2F298%2F2981d14c-1e89-4cfb-849f-6c505f3d67ce%2FphpZRPZV9.png)
Input: data: array of n integers Input: n: size of data Output: 〉 data[i] 1 Algorithm: RecursiveSum 2 if n- 1 thern 3return data[1] 4 else mid – In/ 6return RecursiveSum(data[1..mid])
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured