2) Find the power set A) ((0), (10)), (10, (0}}}, (0, (0}}, 10, (0, 10}}}, (10), (0, (0}}}, 10, 10), 10,10}}}} for this set. 10, (0), 10, (0}}} B) (0, ((0) ), (10, (0} }}, (0, (0}}, (0, (0, (0}}, 0), (10), (0, (0}}}, (0, (0), 10,10)}}} Hint: set a=0 b = (0) C) (0, (0), (10)), (10, (0}}}, (10), 0, (0} }, (0, (0}}, (10), (0, (0}}}, (0, 10), 10,10}}}} c= (0. (0}}, form the power set in terms of a, b, c, then D) (0, (0), (10}}, (10, (0} }}, (0, (0}}, (0, (0, (0}}}, (10, (0}}}, (0, 10), 10,10}}}} back substitute. E) (0, (0), (10}}, (10, (0} }}, (0, (0}}, (0, (0, (0}}}, (10), (0, 10}}}, (0, 10), 10,10}}}}determine the largest n for which one can solve within A) n = 75 one second a problem using an algorithm that requires f(n) bit operations, where each operation is carried out in 10 " seconds, with B) n = 35 f(n) = 40 . C) n = 15 D) n = 150 E) n = 350\f