Theory of Computation Do not try to use ChatGpt this is my last warning i posted this question

$5$

times, Everytime i get a ChatGpt answer, if this time this happened again, I will Downvote it and tell all my friends who have chegg accounts to downvote it and your account will be closed. if you do not know the proper answer with proper DFA like in the Diagram, then Skip. Thank You

Problem $2$

Consider the following DFA over the alphabet $\{a,b\}$ with starting state s$0.$ The accept states are marked with double circles.

$($a$)$ Describe the language recognized by this DFA.

$($b$)$ Show the transition table for this DFA.

$($c$)$ Build an equivalent DFA with a reduced number of states.

$($d$)$ What language is recognized by the complement of the reduced DFA $?$