Need help with these questions. thanks

Given the alphabet ={,0,} draw state diagrams for DFAs over that recognize strings with a) at least one square (Example OO ) b) at most one circle (Example O ) c) ends in a triangle (Example OOO ) d) all three of the above (Example O )