I am not sure about the answers. Please check.
1. L1 is not CFL. L1= {1n 0n 1m 0m, m=n and n>=1}. While parsing, 1n0n will be cancelled out. Similarly, 1m0m will be cancelled out. Now, it can't be checked if m==n. Thus, not CFL.
2. This is CFL. L2= { an bn U an bn+1 U ........ U an b2n }. Each of the grammars are CFL. Since CFL is closed on union, hence it is CFL.