please provide solution for it

0,1 The finite state automaton given by the transition diagram above has The accepting state is [ Select ] N($1, 1) = [ Select ] N*($1, 00010) [ Select ] Is the string 001001 accepted? [ Select ] Is the string 011101 accepted? [ Select ] [ Select ] is the string 000 accepted? 1 00 1(0 1) 01 A string S is in the language accepted by the (0 1)' automaton if and only if N*(so. S) - 01(0 1)" 100101 The language accepted by the automaton [ Select ] can be described by the regular expression