For each of the following languages L: (i) Describe the equivalence classes of L. (ii) If the number of equivalence classes of L is finite, construct the minimal DFSM that accepts L. a) {w {0, 1}* : every 0 in w is immediately followed by the string 11}. b) {w {0, 1}* : w has either an odd number of 1’s and an odd number of 0’s or it has an even number of 1’s and an even number of 0’s}. c) {w {a, b}* : w contains at least one occurrence of the string aababa}. d) {wwR : w {a, b}*}. e) {w {a, b}* : w contains at least one a and ends in at least two b’s}. f) {w {0, 1}* : there is no occurrence of the substring 000 in w}.