Give the state diagrams of DFAs recognizing the following languages over = {0,1}: a. L b. La c. {, 1, 001}