Please do the Exercise 5.1.2 part C.

The set of all strings of a's and b's that are not of the form ww, that is not equal to any string repeated. The set of all strings with twice as many 0's as 1's. The following grammar generates the language of regular expression 0 * 1(0 + 1)*: S rightarrow A1B A rightarrow 0A | epsilon B rightarrow OB |1B | epsilon Give leftmost and rightmost derivations of the following strings: 00101 1001. 00011 Show that every regular language is a context-free language