You are considering a set which has elements, and has a partition in two subsets and which have and elements.
For 1), what you want to know is the number of 5-element subsets of that have at least one element in . That means the "first" element must be in , you have choices, then every subset with elements in union is a solution.
So there are possible committees.
2) can be done is a similar way.