Give regular expressions generating the languages below, presuming the language = {b, c}

a) {w | w contains b in every odd position}

b) {w | w does not contain the substring bcb}

c) {w | w contains at most 3 c's}

d) {w | the length of w is exactly 3}