A five digit number divisible by 3 is to be formed using the digits $0,1,2,3,4,5$ without repetition, then the total number of ways this can be done is

Eight chairs are numbered 1 to 8 . Two women and three men wish to occupy one chair each. First the women choose chairs from amongst the chairs marked 1 to 4 , and then the men select the chairs from amongst the remaining. The number of possible arrangements is

There are 3 sections in a question paper and each section contains 5 questions. A candidate has to answer a total of 5 questions, choosing at least one question from each section. Then the number of ways, in which the candidate can choose the questions, is

The number of arrangements, of the letters of the word MANAMA in which two M's do not appear adjacent, is