Q1: (1.1) Describe the following automata: Q2: (2.1) For the following given DFA, what will be the 'Regular Expression'? Q3: (2.2) Draw Turing machine accepted of language (01*0). Q4:(3.1) Consider the grammar with productions SACCBCaCbAAaAaBbBb Use leftmost derivation to show that the string abbb is in the language generated by this grammar ( S is the start symbol). Q5: (3.2) This question is about DFA. You are given description of a Machine M below: M=({q0,q1,q2},{0,1},,q0,{q1}), where is given by (q0,0)=q0,(q1,0)=q0,(q2,0)=q2,(q0,1)=q1,(q1,1)=q2,(q2,1)=q1. Draw DFA of this machine M and write some strings which are accepted. Q6: which the time taken by searching the shortest path of Hamiltonian Path