The 3-Partition problem is defined as follows. Given a finite set A of 3m elements, a bound B Z⁺ (a positive integer) and a size s(a) Z⁺ for each element a A such that s(a) satisfies the following inequalities: B/4 s(a) = mB.

A) Can A be partitioned into m disjoint sets S₁, S₂, , S_m such that, for 1 i m, s(a) = B?

B) Describe a nondeterministic polynomial time algorithm for this problem