What is the regular expression of this language? $\Sigma = \{0, 1\}$

$L = \{x$| $x \in \Sigma^* $ $\&amp;$ $ \#_0(x) = 3$ $or$  $ \#_1(x) = 3 \}$ 

What is the regular expression of this language?

At first I thought $r = (0+1)^*0(0+1)^*0(0+1)^*0$ $ or$ $ $ $r = (0+1)^*1(0+1)^*1(0+1)^*1$

And what is it's corresponding NFA/DFA?

I've been puzzled by this language and if it's regular for a while now.
Check RE and FA for finite automata construction.

It has to be regular since we can create Regular Expression for it.