6. Construct (draw) a deterministic finite automaton for the language and write all the transition functions. 7" Let the language L {01,001,000). which of the following strings are in L and determine to which subset of L each belongs: (a) 000000000 (b) 01010101 (c) 0010011001 (d) 0000010001 (e) 000001 (f) 8. Knowing that luv-lul + for all strings y and v, use induction to show (prove) for all strings w and all n