Construct a DFA Of language L = {a^ib^jc^k | i,j,k>0}

Question

Can anyone tell me how to solve this question? I am getting confused with the question

Construct a DFA Of language L = {a^ib^jc^k
 | i,j,k>0}

I have tried like this tell me if it is correct or not :

Answer 1

Please see the answer

Answer 2

But your DFA accepts aabbaa !... which is not acceptable in language a^ib^jc^k or after 'b' there should not be 'a' '. I have designed as below , please check that :

Below we have S2 as accepting state.

Comments

Hey thanks for the answer, I have already done this, anyways thanks for answering

---

If that helped you out, you can mark answer as accepted :)