please help me out

Exercise 1 Consider the DFAs below. Find their c grammar g regular b) 2)0-9 Exercise 2: Find the automaton corresponding to the following Regular G (S, A, B a,b, P, S) such that P- b) G= ( {s. A }, {ab: , P,S) such that P A bAl as a Exercise 3: Pigeonhole principle: How many people must be selected from a collection of 15 married couples to ensure that at least two of the persons selected are married to each other. A drawer contains unsorted black, brown, blue and gray socks. How many socks must be chosen in order to be certain of choosing two of the same color Exercise 4 Prove that the following languages are not regular