solve these questions please

1-Minimize the states in the dfa depicted in the following diagram. (chapter 2-exercise 4 ) 2-Construct a dfa that accepts the language generated by the grammar. (chapter 3- exercise 1 ) SabA,AbaB,BaAbb. 3-With an example explain Context-Free Grammars. 4- Define Pushdown automaton. 5- Define a Turing Machine. 6-Briefly explain the Limits of Algorithmic Computation. 7- define recursive functions. (chapter 13.1) 8- what assumptions are made to simplify the computational complexity? (chapter 14.1)