Suppose that the universal set is $U = \lbrace 1,2,3,4,5,6,7,8,9,10 \rbrace$. Express each of the following subsets with bit strings (of length 10) where the ith bit (from left to right) is 1 if i is in the subset and zero otherwise.

(a) $\lbrace 3,4,5 \rbrace$

(b) $\lbrace 1,3,6,10 \rbrace$

(c) $\lbrace 2,3,4,7,8,9 \rbrace$

(d) $\lbrace 1,2,4,8,10 \rbrace$

(e) $\lbrace 3 \rbrace$

(f) $\lbrace 4,5,7,9 \rbrace$