<p>Express the following problems as languages and show that theyare decidable</p><p><img alt="(b) EVERYTHINGDFA: determine whether a given DFA accepts everything, i.e., its language is *" src="https://d2vlcm61l7u1fs.cloudfront.net/media%2F544%2F544a75b8-50a6-4d6e-8895-9a0c80cc755a%2FphpITUsyu.png" style="height:43px;width:1024px;" aria-describedby="d3f"/></p>(b) EVERYTHINGDFA: determine