Automata Theory

1.,) Give regular expressions generating each of the languages of the following:

a. {, 0}

b. The empty set

c. All strings except the empty string

d.) {w| w contains the substring 0101 (i.e., w = x0101y for some x and y)}