from 4 officers and 8 jawans in how many can 6 be chosen to include exactly one officer ?
required number of ways = 4 c 1 * 8 c 5 = 224 answer is e
multiply(divide(divide(factorial(8), factorial(subtract(6, const_1))), factorial(const_3)), 4)