Design a PDA to accept each of the following languages. You may use either PDAs that accept by final state or ones that accept by empty stack, whichever is more convenient. b) The ternary language in all binary strings of the form 0^i 1^j 0^k, where i+k = j, which in CFG it is S-> 0S1 | x and x-> 1X0 | epsilon

For each PDA, please show the transition diagram instead of a sequence of transitions.

Also, show the sequence of transitions as well.

NEED this ASAP. Please SHOW all work!!

Thanks!!