Q15

Consider the DFA $M$ and NFA $M_{2}$ as defined below. Let the language accepted by machine $M$ be $L$. What language machine $M_{2}$ accepts, if $M=(Q, \Sigma, \delta, q_0, F)$ $M_{2}=(Q2, \Sigma, \delta_2, q_{00}, F2)$ Where, $Q2=(Q \times Q \times Q) \cup \{ q_{00} \}$ $\delta_2 (q_{00}, \epsilon) = \{ \langle q_0, q, q \rangle \mid q \in Q\}$ $\delta_2 ( \langle p, q, r \rangle, \sigma ) = \langle \delta (p, \sigma), \delta (q, \sigma), r \rangle$ for all $p, q, r \in Q$ and $\sigma \: \in \: \Sigma$ $A=\{ \langle p, q, r \rangle \mid p \in F; q, r \in Q \}$ $B=\{\langle p, q, r \rangle \mid q \in F; p, r \in Q\}$ $C=\{\langle p, q, r \rangle \mid p, q, r \in Q; \exists s \in \Sigma^*, \delta (p,s) \in F \}$ $D=\{\langle p, q, r \rangle \mid p,q \in Q; r \in F\}$