Given R = (0^∗10^+)^∗(1∪ϵ) and S =(1^∗01^+)^*
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 010
