2. Let Ebe the alphabet E = {0,1,2,3,4}. Then using Definition 1 of section 5.3, (a) Give a recursive definition of the set of strings *. (b) Prior to the first iteration of the recursion, list all the elements then in S*. (c) After the first iteration of the recursion, list all the elements then in S*. (d) After the second iteration of the recursion, list all the elements then in *. 2. Let Ebe the alphabet E = {0,1,2,3,4}. Then using Definition 1 of section 5.3, (a) Give a recursive definition of the set of strings *. (b) Prior to the first iteration of the recursion, list all the elements then in S*. (c) After the first iteration of the recursion, list all the elements then in S*. (d) After the second iteration of the recursion, list all the elements then in *