If you have two numbers 0 and 1, and three positions to place them, the following eight combinations are possible: 000, 001, 010, 011, 100, 101, 110, 111. Design a recursive algorithm that would generate and print each permutation.