Suppose that the universal set is . 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) corresponds to: { }
(b) corresponds to: {}
(c) corresponds to: {}
(d) corresponds to: {}
(e) corresponds to: {}
(f) corresponds to: {}
You can earn partial credit on this problem.