Given = ( + +) + and = ( +)

a) Give an example of a string that is neither in the language of R nor in S.

b) Give an example of a string that is in the language of S but not R.

c) Give an example of a string that is in the language of R but not S.

d) Give an example of a string that is in the language of R and S.

e) Design a regular expression that accepts the language of all binary strings with no occurrences of 001.

f) Design a regular expression that accepts the language of all binary strings which their length is odd with no occurrences of 11.