self doubt

Question

We then define the shuffle of two languages A and B as S(A, B) = {w|∃ u ∈ A, v ∈ B s.t. w is a shuffle of u and v}

Show that if A and B are regular languages over a common alphabet Σ, then so is S(A, B).