https://benar.uml.edu WeBWorK Editor using host: https://benar.uml.edu, format: simple seed: 38

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.