Marching Marshals queue problem

See more:

C++

Consider the problem faced by a group of marshals who are trying to cross as small
wooden bride. The bridge is very narrow and it is impossible for two people to stand side byside. Marshals from the blue unit and red unit are on either sides of the bridge. In spite ofseeing each other they continue to march towards each other and stop only when there is placeexactly for one person in between. At this point they realize that it is way too risky for themto turn back. A marshal can climb over another provided there is a vacant space.

(a) Let r denote the number of red marshals and let b denote the number of blue marshals.
For what all values of b and r is it possible for the marshals to cross over? Why?
(b) Write a computer program to simulate the bridge crossing. Your program should take in
as input two numbers r and b. If it is possible for the marshals to cross over, then your
program should show how the cross over can be achieved.