Question

obtain a DFA to accept strings of a's and b's starting with the string ab

Answer 1

Language for the following DFA will be {ab, aba, abb, abaa.........}, all strings starting with ab.
A is the initial state.
C is the final state.
D is the dead state.

Set of states: {A, B, C, D}
Set of alphabets: {a, b}
Set of language: {ab, aba, abb, abaa.........}

Therefore the following DFA will be obtained.

FOR HELP PLEASE COMMENT.
THANK YOU.