6. Diagonalization (15 points) Let B be the set of all infinite binary sequences that are 1 in odd positions, i.e., any string in B is of the form where we can have 0 or a 1 instead of each *. Show that B is uncountable using a proof by diagonalization