Q: Construct a Push Down Automata for the following languages:

a)

b) L={ aⁿ b^m | n m 2n }

L(G) = { a' bick |i #j+k} U { a' bick i = j + k}