\text { 5. Given } R=\left(0^{*} 10^{\prime}\right)^{\prime} 1^{*} \text { and } S=\left(1^{*} 01\right)^{*} a) Give an example of a string that is neither in the language of R nor in S. [2marks] b) Give anexample of a string that is in the language of S but not R. [2 marks] c) Give an example of a string that is in the language of R but not 5. [2 marks] d) Give an example of a string that is in the language of Rand S. [2 marks] e) Design a regular expression that accepts the language of all binary strings with no occurrences of b ab [4 marks]