given sets w,x,y and z, each of size n, and a collection c of ordered 4-tuples of the form (wi , xj , yk,zl), do there exist n 4-tuples from c so that no two have an element in common? prove that 4-dimensional matching is np-complete