Sigma $=\{0,1\}.$ For the following language, give the corresponding DFA $($The representation of DFA can be the state transfer diagram$/$table method $($i$.$e$.,$ drawing the state transfer diagram$/$table for the automaton$)$ or the mathematical representation $($function method$)($i$.$e$.,$ for the DFA, give it directly$).$

$($i$.$e$.,$ drawing the state transfer diagram$/$table of the automaton as mentioned in the class$)$ and the mathematical representation $($the function method$)($i$.$e$.,$ for the DFA, give the definitions of Q$,\backslash$Sigma $,$ delta, q$0,$ F directly$).$

$(1)$ Any set of consecutive strings of $5$ symbols containing at most $31$s$.$ For example: $01111,10111,11011,1111,0001111000$ is

not accpeted. $10001,110,10,111$ is accepted.