Discrete Math Pumping Lemma. Please complete parts D and E . Thank you!

D and E only

Use the Pumping Lemma to show that each of these languages is not regular. AB L=(anbkc" : n > 0, k >n) B I L-{b"ckd : n > 0, k > 0} (Note that -{ b, c, d, f) for this problem.) L = {w {a, b)" : na(w) = nb(w)} DAL = {prqst" : u-r + s) (Again, = { p, q, t } for this problem.) EQ L = {a"b": n/k is an integer)