1.

Let C be a set containing (3n + 1) elements and A is a sub-set of C containing exactly an elements, then the number of ways of choosing sub-set BofC such that: A sube B sube C, B ne A, B ne C, is

Answer»

`2^(2n+1)`
`2^(2n-1)`
`2^(2n+1)-2`
`2^(2n+1)-2^(2)`

ANSWER :C


Discussion

No Comment Found

Related InterviewSolutions