There are n black, m green, and k brown chameleons on a deserted island. When two chameleons of different colors meet they both change their color to the third one (e.g., black and green chameleons become brown). Design and implement an algorithm that for each choice of n, m, and k will decide whether it is possible that after some time all chameleons on the island are the same color. If you think that it is always possible, check the case n = 1,m = 3, and k = 5