PLEASE PROVIDE THE PARSE TREE FOR A AND B.

Provide a CFG for each of the following regular expressions. Follow your answer up by providing a tree for an example of such a string

a) R=(c+d)^* dd(c+d)^* In this case (c+d)^* implies any number of cs and/or ds.

b) R=0^* 1(0+1)^* Again, the asterisk implies any number of such items. In case any number of 0s at the beginning and the second asterisk implies any number of 0s and 1s.