Class $P$ problems are closed under Union, Complement.

b$)$ Explain the meaning of polynomial time reduction. Prove that if $B$ is in $P$ and $ApB,$Discuss variants of Turing Machine. Design a Turing Machine that will accept the

language $L=\{0^n{1}^n|n1\}.$

then $A$ is in $P.$