Question

Uncountable Union Of Countable Set Is _______

1) Countable

2) Uncountable​

Answer 1

Answer:

It is consistent that the countable union of pairs is uncountable (in the sense that it has no countable subset, but also it is possible that it has). It is consistent that countable union of finite sets is countable, but there is a countable set of countable sets whose union is uncountable.

Answer 2

Answer:

I hope that answer is (1)

Step-by-step explanation:

countable