There are 165 different committees possible where no member has any specific responsibilities
To solve this problem the formula and the combination procedure we must use is:
C(n/r) = n! / [(n-r)! *r!]
Where:
Information about the problem:
Applying the combination formula we have:
C(n/r) = n! / [(n-r)! *r!]
C(11/3) = 11! / [(11-3)! *3!]
C(11/3) = 11! / [(8)! *3!]
C(11/3) = 11*10*9*8! / [(8)! *3!]
C(11/3) = 11*10*9/3!
C(11/3) = 990/6
C(11/3) = 165
In mathematics, a combination or combinations are all the possible groupings that can be made of a given number of elements, without repeating them and regardless of the order in which they are found.
Learn more about combination at: brainly.com/question/11732255
#SPJ4