Algorithm 1: Simulate DFA (dragon book p. 151) Input: An input string x, a DFA with start state so, accepting states F. Output: "yes" if D accepts x, "no" otherwise. S= So; while (c=nextChar())!=eof do s= move(s,c); end if se F then return "yes" ; end return "no"; Given a DFA depicted in the digram below, and a string abbabb. 1. Write down the trace to run the DFA on that string. 2. Whether the string can be accepted by the DFA