Suppose that the universal set is [math]. 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) [math] corresponds to: { }

(b) [math] corresponds to: { }

(c) [math] corresponds to: { }

(d) [math] corresponds to: { }

(e) [math] corresponds to: { }

(f) [math] corresponds to: { }