Let be countable sets, and let their Cartesian product x x x ..... be defined to be the set of all sequences where , is an element of . Prove that the Cartesian product is uncountable. Show that the same conclusion holds if each of the sets has at least two elements.