Give the state diagrams of DFAs recognizing the following languages over = {a, b, c}:

{w : w begins with prefix abc and ends with suffix bca}