2. a. For the language L = {0,1),find a regular expression representing the following: i [5 marks] All strings that do not begin with 11 ii. [5 marks] All strings in which every appearance of 0 is followed directly by a 1. b. [10 marks] Convert the following non-deterministic finite automaton into regular expresion: D 0,1 8 B (20 marks)