For each of the following languages either show that it is context free by giving a CFG for the language or show it is not context free by using the pumping lemma: (1) {(01)^i2^i| i greaterthanorequalto 0} (2) w | the # of 0s in w = the # of ls in w= the # of 2s in w} (3) {0^i#0^j#0^i plusminus j| i, j greaterthanorequalto 0} (4) {0^i#0^j#0^i+j | i, j greaterthanorequalto 0}