the language For languages A and B, let the perfect shuffle of A and B be {wl w a1b1 . . . akbk, where a1 . . . ak E A and bi . . . bk E B, each ai, bi Show that the class of regular languages is closed under perfect shuffle. .41 E }