A boy has Rs 2. He wins or loses Re 1 at a time If he wins he gets Re 1 and if he loses the game he loses Re 1. He can loose only 5 times. He is out of the game if he earns Rs 5.Find the number of ways in which this is possible

Starting from Rs 2 and ending at Rs 5 with max 5 losses means reaching exactly Rs 5. Each win is +1, each loss is -1. The path requires 3 more wins than losses overall (Rs 2→Rs 5 = +3). With maximum 5 losses, we can have 8 wins and 5 losses. This is a combinatorial path-counting problem with constraints. The answer is 16 valid paths.