Please help with the following exercise

(a) Consider the following DFA A : it has four states s,p,q and r, its initial state is s, its accepting state is r, and its transition function is given by the table Draw a state transition diagram for the DFA A and describe the language L(A) in English. (7 marks) (b) Select all regular expressions below that represent the language of A in part (a). Explain your answer. (8 marks) (i) 1(01)0001(01) (ii) (01)001(01) (iii) (101)0001(01) (iv) (101)0001 (c) Transform, using the subset construction, the following nondeterministic finite automaton into an equivalent deterministic finite automaton. Show your working