Please do all of them! Thank you!

2. (5 points) Give a CFG for the following language and a parse-tree yielding string w a) (01" In0 000111 b) w w contains at least three 1s), w 01011 c)w the length of w is odd ) 010101 d) (w w is a palindrome ], w 10001 e) (w w contains twice as many a's as b's), wbaabaa