5) Suppose a new type of machine is defined called a DFA-m that can have 1 or more start Otherwise, a DFA-m is just like a DFA. For example, a DFA-m with 3 start states is shown below go 9 0 0 0, 1 0 9 4 Given a string w and a start state q, there is exactly one computation by the DFA-m. In addition, for any given string w, the number of computations by the machine is equal to the number of start states. For example, for the string 0010 there are three possible computations, one beginning in each start state. For such a machine, a string w is said to be accepted if there exists a start state in S such that a computation starting from that state on w leads to a final state. (a) (3 points) Based on the above definition, is the string 11011 accepted by the above DFA-m (yes or no)? If so, then show an accepting computation by the machine on the string. (b) (3 points) Based on the above definition, is the string 0110 accepted by the above DFA-m (yes or no)? If so, then show an accepting computation by the machine on the string