Question $1$:

Construct PDA for this language contains twice as many $0$ s as $1s.$

Question $2$:

Construct PDA using the following CFG:

$RxRx|S$

$S$aTb$|bTa$

$TxTx|x|$

$xa|b$

Question $3$:

For the following language $,$ consisting of all strings of $0$ s whose length is a

power of $2$ :

Design the Turing Machine

Give the sequence configuration for $\text{'}00\text{'}$