1. First 1 is not CFL because it cannot be realised using a PDA. It's in fact a CSL langalan accepted by Turning machine.
2. Given condition i + k = j + l ;
It can be written as i - j = l - k. Push all A's and Pop for every B's remaining is i - j in the stack. Similarly push all C's and Pop for every D remaining is l - k. It can be compared. It's a DCFL.
Please correct me if wrong..!