Question (
see uploaded pic
):
Given Code (Python):
def binary_to_decimal_1(str, n):
#Base Case/s
#Add conditions here for base case/s
if True :
print("I will be printed before this recursive function ends.")
return 0
#Recursive Case/s
#Add conditions here for recursive case/s
else:
return binary_to_decimal_1(str, n)
def binary_to_decimal_2(str):
#Base Case/s
#Add conditions here for base case/s
if True :
print("I will be printed before this recursive function ends.")
return 0
#Recursive Case/s
#Add conditions here for recursive case/s
else:
return binary_to_decimal_2(str)
#Handle binary string input.
binary_string = input("Please enter a binary string: ")
print(binary_string)
#Do function calls and print return values.
Extracted text: The code is already given above. Problem: Using PYTHON, create a code that asks you to enter a binary string and you must use this binary string as an input to your functions. These functions will be recursive functions that return the decimal number equivalent of your binary string input. Example (Input): Example (Input #2): 1111 0000 Example (Output): Example (Output #2): Please enter a binary string: 1111 Calculating the decimal number equivalent using implementation 2. The decimal number equivalent of 1111 is 15. Please enter a binary string: 0000 Calculating the decimal number equivalent using implementation 1. The decimal number equivalent of 0000 is 0. Implementation 1: A recursive function with two inputs: a binary string, and a number. You can think of this 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. Constraints: 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 used.