Use a proof to prove that the recursive algorithm for finding the concatenation of i copies of a bit string that you gave in Exercise 38 is correct.

38)

We shall find a recursive algorithm for finding the string w, the concatenation of I copies of w when w is a bit string. Procedure: concat(w:originalString, i:numCopies) if (i = 0 ) return result;return w concatenated with power (w, 1