Consider the following DFA:

Which describes the language of this DFA?

All binary strings with at least two $0\text{'}$s and exactly one $1.$

All binary strings with exactly one $0$ and at least two $1\text{'}$s$.$

All binary strings with at least two $0\text{'}$s and at least one $1.$

All binary strings with at least one $0$ and at least two $1\text{'}$s$.$

All binary strings with at most one $0$ and at least one $1.$

All binary strings with at least one $0$ and at most one $1.$