Write a program that asks the user to enter a binary string and you must use this binary string as an input to your functions. These functions that are to be created will be recursive functions that return the decimal number equivalent of your binary string input. For this exercise, you will develop 2 different ways of solving this problem: • Implementation 1: A recursive function with two inputs: a binary string, and a number. (Hint: You can thin of this number as the index that allows you to access each element in your sequence.) • Implementation 2: A recursive function with only one input: the binary string. Conditions: Do implementation 1 if the binary string starts with a '0'. Otherwise, do implementation 2 if the binary string starts with '1'. Before you return a value in your recursive function's base case, print a statement that reveal

Use python

1. You are to create a well-formed Python recursive function (i.e, there must be a stopping/base case and the recursive case must present a smaller problem), along with a call to that function. 2. Trace your function and call. Remember that you must keep track of memory for each function call and provide output. How would I trace a function? and keep track of its memory for each function call?

language: Python   Problem:  Write a recursive function to add a positive integer b to another number a, add(a, b), where only the unit 1 can be added, For example add(5, 9) will return 14. When creating the function, also create a test case to prove the program works. The pseudocode is: # Base case: if b is 1, you can just return a + 1# General case: otherwise, return the sum of 1 and what is returned by adding a and b - 1

Below, enter code to complete implementation of a recursive function palindrome() that determines whether an input string is a palindrome or not: 3. palindrome(s):

language: Python   Problem:  Write a recursive function reverse(sentence) for reversing a sentence. For example, reverse('Who let the dogs out?') will return '?tuo sgod eht tel ohW'. Also write a test case in the program to prove the function given works.

Write a lisp program (please provide photos that it works)

Computer scientists and mathematicians often use numbering systems other than base 10. Write a program that allows a user to enter a number and a base and then prints out the digits of the number in the new base. Use a recursive function baseConversion (num, base) to print the digits. Hint: Consider base 10. To get the rightmost digit of a base 10 number, simply look at the remainder after dividing by 10. For example, 153 % 10 is 3. To get the remaining digits, you repeat the process on 15, which is just 153 // 10. This same process works for any base. The only problem is that we get the digits in reverse order (right to left). The base case for the recursion occurs when num is less than base and the output is simply num. In the general case, the function (recursively) prints the digits of num // base and then prints num % base. You should put a space between successive outputs, since bases greater than 10 will print out with multi-character "digits." For example, baseConversion(1234,…

Please answer quickly in python

language: Python   Problem:  Write a recursive function power(x, n), where n is 0 or a postive integer. For example, power(2, 10) will return 1024. Write a suitable base case, and for the general case use the idea that xn = x * x n-1.