From city A to B there are 3 different roads. From B to C there are 5. From C to D there are 2. Laxman has to go from city A to D attending some work in city B and
C on the way and has to come back in the reverse order. In hi many ways can he complete his journey if he has to take a different while coming back than he did
while going?
Neetu has five identical beads each of nine different colours. She wants to make a necklace such that the beads of the same colour always come together. How
many different arrangements can she have?