onsider the DFA over the alphabet $\{0,1,2\}$ defined as follows:

q$0$ is start state; $\{$q$0,$ q$2\}$ are accepting states.

$($q$0,0)->$q$1$

$($q$0,1)->$q$0$

$($q$0,2)->$q$2$

$($q$1,1)->$q$0$

$($q$1,0)->$q$3$

$($q$1,2)->$q$3$

$($q$2,0)->$q$0$

$($q$2,1)->$q$0$

$($q$2,2)->$q$2$

$($q$3,0)->$q$3$

$($q$3,1)->$q$3$

$($q$3,2)->$q$3$

From the following, select the language matched by this DFA. $($in all possible answers, w refers to a string that belongs to the said language$)$