1
You will be given an integer n, and you must print all permutations upto and including size n based on the alphabet {0, 1}, in the following format:
n = 0
print {}
n = 1
print {0, 1}
n = 2
print {0, 1, 00, 01, 10, 11}
n = 3
print {0, 1, 00, 01, 10, 11, 000, 001, 010, 011, 100, 110, 101, 1...