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 x.

Input: data: array of n integers Input: n: size of data 7L Output : data[i] 1 Algorithm: RecursiveSum 2 if n=l then a | return datall] 4 else s | mid-|n/2] 6 return RecursiveSum(data [1.mid) 7 end RecursiveSum(data[mid 1..n)