For part B give a state diagram of the PDA using acceptance by empty stack. Show all transitions as mentioned.

Consider the set of all strings over fa, by with no more than twice as many a's as b's: (a) Give a CFG for this set, and prove that it is correct. (b) Give a pushdown automaton for this set. Specify completely all data (states, transitions, etc.) and whether your machine accepts by final state or empty stack. Show sample runs on the input strings aabbaa, aaabbb, and aaabaa