If a string S is accepted by a finite state automaton, S$=$s$1$s$253..$ $a Where s$,$ and there exists a sequence of states To$.$ T$1.$ T$2.....$ In such that o$($r$($i$),$ s$+1)=$r$+1$ foreach $0.1..$n$-1.$ then r$(0)$ is:accepting stated Ointermediate state Oinitial state