i need help with all 3 parts of question (a, b, c) thank you!

5. a) Give an example of a string in the language of (0-10) [1 mark] b) Give an example of a string that is not in the language of 0'10+) [1 mark) c) Design a regular expression that accepts the language of all binary strings with exactly one occurrence of aa. [3 marks]