Please answer problem 2. in detail:

Problem 2: You are given a language as a set (i.e., A) of two strings defined over an input alphabet E. Construct a Finite State Machine (FSM) that accepts the complement (i.e., A') language. E = {a,b,c} and A = {abc, cba} (a) Describe your solution steps. (I am looking for some description of your selected method for solution. The steps should not involve the use of a software.) (b) Show your construction of the FSM by following the steps in Part (a) without the help of software. You may use the other side of this page or extra sheet for your work