Finding a correct regex for the strings with at least two \$0s\$

I am learning CFGs and before that I’ve made a RE (Regular Expression) for the language of “all strings with at least two $$0$$‘s over the alphabet $$\Sigma = \{0,1\}$$.”

I made this: $$(0+1)^*0(0+1)^*0(0+1)^*$$

I checked the answer and it is: $$1^*01^*0(0+1)^*$$

Is there any difference between the two?

If mine is also correct, what should be the CFG for it?