The number ways in which n distinct objects can be put into two distinct boxes so that no box remains empty, is
(A) 2^(n)-1
(B) n^2 -1
(C) 2^n -2
(D) n^2 -2
(E) n!
Please Explain!![]()
(A) 2^(n)-1
(B) n^2 -1
(C) 2^n -2
(D) n^2 -2
(E) n!
Please Explain!