(c) Write the paths representing parsing of the following input by the automato depicted below. State if the input is accepted or rejected. i. abaa ii. abbab iii. babab iv. baaba A a b a b B b a b a D E b a

As per our guidelines, we are supposed to answer one question and if subparts are available then 3 subparts. I have answered all the 4 subparts of the question (c).

I have uploaded images for the subparts solution and have explained the step-wise solution just like asked in the question. I hope the solution helps you.

Let's understand a few basics first: 

• We always start with the start state, in this DFA, the start state is state A.
  
• Final states are represented using a double circle, in this DFA we have 3 final states- A, B,C
• After traversing a string if at the end we land at one of the final states then the string is accepted.
• If we land at one of the non-final states at the end then the string is not-accepted by DFA.