Consider a language L= {anbmck|n+2m=k for n, m>=0} and perform the following tasks:

1. Create a Context-Free Grammar (CFG) and apply simplification rules.
2. Convert the resultant grammar found in part a into Chomsky Normal Form (CNF).
3. Generate the parse tree after testing the given string aabbbcccccccc.