Showing that the class of regular languages are closed under merging / modified shuffle
Express the two languages as NFA.  Use a product construction.  Think carefully about what transitions should exist in the product automaton.