Question $10$:

Construct a PDA for the following language and also write all transitions.

a$.=\{a,b\}$ such that it accepts the language $L=\{a^n,b^n|n1\}.$

b$.=\{a,b\}$ such that it accepts the following language $L=\{a^n,b^{2n}|n1\}.$

c$.=\{a,b\}$ such that it accepts the following language $L=\{wR{w}^R|win(a,b{)}^{**}\}.$

d$.=\{a,b,c\}$ such that it accepts the following language $L=\{wR{w}^R|win(a,b,c{)}^{**}\}.$

e$.$ that can hold the alphabets of the language $(1^n{0}^n)$ and the string of the language must be

greater than $6$ characters.