only the answer without explanation

Which type of language it will generate over alphabet {a,b} a 9,6 b 4,6 90 91 92 Dead state Accept state Set of string ends with a orb Set of string start with a and ends with b b a,b 90 91 (92 Dead state Accept state Set of string ends with a orb Set of string start with a and ends with b Set of string ends with b Set of string ends with a .Which string not generated by the given DFA a,b ) D a b 90 91 92 accept b b a 93 a,b ababababa ababbbbb abbbbbbbbbbba ab a 90 91 b 92 accept b 3 a,b ababababa ababbbbb abbbbbbbbbbba bababababb Which type of strings it will generate a,b a 91 b 92 accept b a 93 9,6 90 91 (92 accept b a 93 a,b { all strings with prefix ab } { all strings with prefix abb} { all strings with prefix aab } { all strings with prefix ba} . Regular expression (alb)(alb) denotes the set {a, b, ab, aa) {a,b, ba, bb) (a, b) (aa, ab, ba, bb