Suppose that the universal set is $U = \lbrace 1,2,3,4,5,6,7,8,9,10 \rbrace$. Find the subsets specified by the given 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) $0011100010$ corresponds to: { }

(b) $1000011001$ corresponds to: { }

(c) $0101001011$ corresponds to: { }

(d) $1101000101$ corresponds to: { }

(e) $0010000100$ corresponds to: { }

(f) $0000001000$ corresponds to: { }