Give a DFA M$3$ that accepts the language L$3$ consisting of strings on $\{0,1\}$ such that the value of the string, interpreted as an unsigned binary representation of an integer, modulo $8$ is $3.$ Assume that the string is input starting with highest order bit first. Also, note that we allow leading $0$s in a string, e$.$g$.,$w$=00001001$ represents the integer $9.$