I would like to receive feedback regarding my answer. Check if it is passing the pumping lema statement to symbolic predicate correctly and if the contrapositive is correct.

Also, I would like to receive help with understanding and finding the solution for part B

Write down the contrapostive of conditional statement in the Pumpimg Lemma. ( M is a tinite state machine) [2] Contrapositive To complete the proof that L={0k1k,k0} cannot be recognized by a finite-state machine, we show that the hypothesis of the conditional statement you have written down in Part A) is true for L={0k1k,k0}. Your Proof: (Hint. Generalizing from generic particular and proof by cases)