Automata Theory Question

While solving these, can you mention what needs to be done step by step to solve such questions?

Thank you in advance.

For alphabet S = {0,1} build a DFA equivalent to the following regular expression: (((0+10)(10)*(11 + 0)) +11)(0+1)* Give a DFA with at most 3 states for the following language: L = {w {0,1}*, r EN|(w)2 = (r)10 and r = 0 (mod 3)} Assume input is read from left to right. (e.g. w = 1001EL since (1001)2 = (9) 10 and 9 = 0 (mod 3))