Any help would be awesome!

Design context-free grammars for the following languages. Using your grammar, give derivations for the example strings: 1. L = {wl w is the set of strings over 0,1 that are of the form on 12n for n>=01 example: 001111, 011. a. (w w is the set of strings over a,b that has equal numbers of a's and b's in any order) example: baab abab, ba, ?. b. L c. L = {w| w is the set of strings over 0,1 that are of the form 0n1mOn for mene0 L = {w| w is the set of strings over ab with odd length and contain exactly 2 b) example: bba, aababaa, d