$**$read carefully$**$ Any answer clearly created with LLMs will receive a thumb down.

Given R $=(0*10+)*(1$ U $)$ and S $=(1*01+)*$

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

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

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

$($d$)$ Give an example of a non$-$empty 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.$

Thank you for your help