Show how the following languages are regular by designing a DFA that accepts it. Also, provide an explanation of how each DFA works.

a) {01x10 | x {0, 1}* }

b) {x {0, 1}* | 3 |x| 5}