1. Prove that every finite language is regular. Hint: Give a constructive proof that explains how to start with a finite language (set of strings) A and then build an NFA that accepts any string in A. There is a "brute force" style of NFA that ends up with a total of I0l Iwl states. Sketch the NFA corresponding to A00, 11, 10 w EA