1.Prove that the following algorithm is correct for all arrays with at least 1 element. Note that [x] represents the floor function, which returns the largest integer less than or equal to x.

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])