1. If L1 and L2 are regular language, prove that L= L1-L2 is regular (elements in L1 that are not in L2). 2. Find a regular expression that generates the complement of language accepted by the following DFA. 91 a a b a qo 92 b 3. Show that the language defined by {aubka" | n>=0, k>=n} is not regular