Give regular expressions generating the following languages. In all parts the alphabet is {0, 1}

a. {w | w has at least one 1}

b. {w | w starts and ends with same symbol}

c. {w | |w| < 5}

d. {w | every 3rd position of w is 1)