From $i$=$j$+$k$ , we can say no.of $a's$ =no. of $b's$+ no.of $c's$.
With the help of stack, whenever we see $a's$ push them and pop $b's$ and $c's$. If the stack is empty string is accepted otherwise rejected.
So,with the help of this we can say given language is CFL. Particularly it's DCFL($Deterministic$ $ CFL$)