Consider the language L $=\{$aibjck $|$ i$+$k $=$ j$\}.$ In a proof that L is not regular, you would assume L is regular, with pumping length p$.$ Which of the following could you then apply the Pumping Lemma to$.$ Check all that apply.

Note: I am not asking which would lead to a successful proof that L is not regular, just which qualify for applying the Pumping Lemma.

Group of answer choices

aaabbbbc

apbp

bpcp

apbpcp

ap$/2$bpcp$/2$

apb$2$pcp