2. Design and draw a PDA that accepts the same language as the following grammar: X if C then X X - if C then X else X X print("Hi") X print("Bye") where = {if, C, then, else, print("Hi"),print("Bye")}, V = {X}, and the start symbol is X. I can be any set of stack symbols you want to use. This problem is trickier than it looks. Hint: My approach was to start drawing an NFA, and then observe why a stack is needed. At that point, I went back and added stack operations to some of the arrows. Any arrow without a stack operation will be assumed to be a no-op, i.e. +