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...

Extracted text: 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 think 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 reveals the identity of the function that is currently being used.