Given R = 1* (0*10+)+1* and S =0*(1*01+) *0* = 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 Rand S. e) Design a regular expression that accepts the language of all binary strings with no occurrences of aab