Problems: Problem I: With reference to the languages of the previous problem, does there exist a mapping reduction from ETM to B? Briefly justify your answer.
Problem II: Consider this problem Q: Given a collection of integers x1, x2, ..., xn, is there a subset SÌ{1, 2, ..., n} such that %)(??%=%?(??%? In other words, can these n integers be partitioned into two subsets whose sum is equal? Show that this problem is NP-complete.
[Hint: To show that Q is NP-hard, devise a polynomial-time reduction from SUBSET-SUM.]