Fix the alphabet to be E = {a}. For each of the conditions below, give an example of a language L on the alphabet E that satisfies the condition. Briefly justify why your example satisfies the...

Extracted text: Fix the alphabet to be E = {a}. For each of the conditions below, give an example of a language L on the alphabet E that satisfies the condition. Briefly justify why your example satisfies the condition. (a) L+ = L* - {\}. (b) L = L+. |3| (c) LL and L* is finite. (d) L = L and L is finite.