Draw a PDA $($pushdown automata$)$ that recognizes the following language:

$A=\{win\{0,1{\}}^{**}|w$ contains $at$ least three $1(s)\}$

Give an informal description of a TM $($Turing machine$)$ that accepts the inputs with same numbers of $0\text{'}$s$,1\text{'}$s$,$ and $2\text{'}$s and rejects the rest. For Example: $112020201$ is accepted but $210211021$ is rejected.