Question

Give a recursive algorithm for finding the string${\mathit{w}}^{\mathbf{i}}$ , the concatenation of icopies of w, when w is a bit string.

Short answer

The recursive algorithm for finding the string$w^i$ for given.

Step-by-step solution

Given that 

Given a string $w^i$, the concatenation of icopies of w, when w is a bit string.

This algorithm practically writes itself.

Write recursive algorithm

The recursive algorithm is as:

procedure power(w: bit string, i : nonnegative integer)

if i = 0 then return $\lambda$

else return wconcatenated with power (w , i - -1)