Describe in English the definition of the language and give a regular expression for the language accepted by each of the following TGS:
a) L=w∣w contains at least three consecutive 0′s
b) L=w∣w contains an even number of 1′s
c) L=w∣w starts with 1 and ends with 0
d) L=w∣w contains 101 as a substring