Theory Of Computation 26,DFA which accepts strings={ a^nb^m c^l| n,m,l greater than or equal to1}

In this video I have discussed how to construct the minimal DFA over {a,b} which accepts l={ a^nb^m c^l| n,m,l greater than or equal to1}