Prove if a language L is recognizable, then so is L^(star) . Again, do this with a high-level description. (Hint: first solve for L L and think in terms of the number of steps in the Turing machines.)