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