Both language $1$ and $2($shown below$)$ areTuring complete in the sense that they can be used to describe all the computations that a Turning machine can perform.Language $1$boolean expressions integer variables integer arithmetic$($including $++$ operators like those sequential execution of statements if$-$then statements assignment statements while$-$loopsProve that a language is also Turing complete if it $($just$)$ contains the following constructs:Language boolean expressions integer variables integer arithmeticsequential execution of statements assignment statements while$-$loopsNote that "proof by specific example" is not a