Question 1: Write a program that asks the user for a binary string that also contains x's. A binary string is a sequence of 1's and 0's. Your program should display all possible binary strings where the x's can be replaced with either 1's or 0's.
Enter a binary string: 1011
Enter a binary string: 10x0
Enter a binary string: xx0x
1.Write a program that is called funa() that implements the following function (part a&b below)
2.Write one more program that also is called funa() that implements the same function from last question but only makes one recursive call per recursion.