Using the previous exercise with b=2 (binary), show that cardinality of R is the same as the cardinality of P(N), obtaining yet another (though related) proof that R is uncountable. Hint: Construct two injections, one from [0,1] to P(N) and one from P(N) to [0,1]. Hint 2: Given a set A⊂N, let the nth binary digit of x be 1 if n∈A.