Provide the graph and table representation for the following DFA Odd binary numbers

Example: C $=\{00000001,0101,111111,$ etc.$\}$

Formal definition of your DFA.

Hint

Formal Definition of a DFA

A can be represented by a $5-$tuple $(Q,,(\frac{?}{\text{b}\text{a}\text{r}}()),q_0,F)$ where $-$

$Q$ is a finite set of states.

$$ is a finite set of symbols called the alphabet.

$$ is the transition function where $$:$QQ$

$q_0$ is the initial state from where any input is processed $(q_0$inQ$).$

F is a set of final state$/$states of $Q(FsubeQ).$