for any integer n ≥1 let bndenote the set of all binary strings of length n. find a bijection between bnand p({1, 2, . . . , n}), and show that it is indeed a bijection. conclude from this that |bn|