Given the alphabet = {, , } draw state diagrams for DFAs over that recognize strings with

a) at least one square

b) at most one circle

c) ends in a triangle

d) all three of the above