Please answer only part a and part c in the most detailed, complete and easy to understand and visualize manner as possible.

Diagrams are appreciated. Please dont attempt unless you are completely confident in your solution.

Exercise 6.2.1: Design a PDA to accept each of the following languages. You may accept either by final state or by empty stack, whichever is more convenient. *a) [0"1" 1n21) b) The set of all strings of O's and 1's such that no prefix has more 1's than 0's. c) The set of all strings of O's and 1's with an equal number of 0's and 1's