Please Show Work, Thank you?

43. Write a context free grammar that accepts the language Lzczwhere z E sa, b and z is the reverse of the string z. 44. Write a context free grammar that accepts the language L- [zz)where z E [a,b]. 45. Write a context free grammar that accepts the language over the alphabet-[a, b) where number of a's is strictly greater than number of b's. 46. Eliminate backtracking for a given grammar. For example: Eliminate backtracking from the following set of rules: E-> E + T I E + (T) | T T->FLE+ (id) | E F-> id