finite automata – Conversion of eNFA to DFA

So, I was watching a video about the conversion of e-NFA to DFA. In the video she didn’t write the 4th state because the 3rd state is an epsilon transition as you can see in the following image

enter image description here

so my question is if the 3rd state was 0 transition like in the 2nd diagram then could I write 2,4,5, and 6 states while inputting 0 value for the 3rd state?

enter image description here