The Zeroing Problem takes in an array of size n and returns an array of the same size containing all zeros. Prove that the algorithm below correctly solves the zeroing problem for all arrays of size n 1.

Use strong induction.

Input: data: array of n integers

Input: n : size of data

Output: an array containing n zeros

Algorithm: RecursiveZero

if n = 1 then

data[1] = 0

else

mid = [n / 2]

data[1 .. mid] = RecursiveZero(data[1 .. mid])

data[mid+1 .. n] = RecursiveZero(data[mid + 1 .. n])

end

return data

Don't give me the same answer as the other chegg questions, explain your process!