1. Let { 0,1 }, describe the following language: 2. Let = { 0, 1 }, construct a regular expression for: All string ends with 01. 3. Let = { 0,1 }, construct a finite automata for: (0 + 1 ) + ( 0 + 1) 2 4. What language will the following finite automata accept? 0, 1