please use strong induction and make it clear with the required steps

1. 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 2 1. Hint: you will need strong induction. Input: data: array of n integers Input: n: size of data Output: an array containing n zeros 1 Alg iveZerd 2 if n-1 then 3 | data[1]=0 orithm: Recurs 4 else mid= Ln/2] 6data[1..mid RecursiveZero(data[1..mid) 7data[mid + 1..n -RecursiveZero(datamid +1.n]) 6data 1..mid- s end 9 return data