Use the mathematical induction steps to solve this.Please do not miss any induction step to prove the algorithm correctness

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 Algorithm: RecursiveZero 2 if n = 1 then | data[1] = 0 4 else mid = [n/2] data[1..mid] = RecursiveZero(data[1..mid) data[mid + 1.n] = RecursiveZero(data[mid + 1..n]) 3 8 end 9 return data