(a) What is the language accepted by the FSA depicted below? 0 0 start--( A 0 0 (b) Draw a transition diagram for a Finite State Automaton (FSA) to accept the set of all strings of O's and 1's that contain the pattern 011. (c) State an example of an application of a FSA. Does an algorithmic implemen- tation of a FSA require a data structure? What is the difference between FSA and Turing Machines? Briefly discuss