6. consider the problem of determining whether a dfa accepts strings containing an equal number of 0s and 1s. convert this problem into a language, and then prove it is decidable. 20 points