construct the PDA for the following context$-$free languages. $1.$ Strings of the form $0^($n$)1^(2$n$),$ n$>=02.$ Strings of the form $0^($n$)10^($n$),$ n$>=0$ Note: $0^$n means $0$ repeated n times. Similarly for other symbols too.