please show steps. Thanks in advance

answer 2.39 using 1.42

de Class Context-lee languages is llu Ciucu unuci PureL JUL. 2.39 Refer to Problem 1.42 for the definition of the shuffle operation. Show that the class of context-free languages is not closed under shuffle. 1.42 For languages A and B, let the shuffle of A and B be the language {w w = a b ... axbk, where a ...ak E A and b1 ... * E B, each ai, bi Show that the class of regular languages is closed under shuffle. *}