A string over an alphabet ? is a finite list of symbols from that alphabet. For L a set of strings, we can define the following associated sets

Question 2. (10 points) A string over an alphabet ? is a finite list of symbols from that alphabet. For L a set of strings, we can define the following associated sets DOU BLE(L)-fvv I vEL STUTTER(L) = {W1w1WyWy . . . u'nu'n l n > 0. ui E ? for each i where I