Consider the following program

Program P2
      var n:int;
      procedure W(var x:int)
      begin
          x=x+1;
          print x;
      end

      procedure D
      begin
          var n:int;
          n=3;
          W(n);
      end
begin     \\begin P2
      n = 10;
      D;
end

If the language has dynamic scooping and parameters are passed by reference, what will be printed by the program?

Consider the following problem $$X.$$ Given a Turing machine $$M$$ over the input alphabet $$\sum , $$ any state $$q$$ of $$M$$ And a word $$w\,\,\varepsilon \,\,\sum {^ * ,} $$ does the computation of $$M$$ on $$w$$ visit the state $$q''$$

Which of the following statements about $$X$$ is correct?

Consider the following two statements;
$${S_1}\,\,:\,\,\left\{ {{0^{2n}}\left| {n \ge 1} \right.} \right\}$$ is a regular language
$${S_2}\,\,:\,\,\left\{ {{0^m}{1^n}{0^{m + n}}\left| {m \ge 1} \right.\,\,and\,\,n \ge \left. 1 \right\}} \right.$$ is a regular language

Which of the following statements is correct?

Given an arbitrary non-deterministic finite automaton $$(NFA)$$ with $$N$$ states, the maximum number of states in an equivalent minimized $$DFA$$ is at least