Prove or disprove each of the following: a) L₁ = {ab, aab, bbb, aabaa} is regular. b) Every finite language is regular. Hint: Consider the explicit definition of a set. Apply that to finite languages, and write a constructive proof that creates a regular expression for any given finite language that is expressed explicitly.