4.7.1: Writing a recursive math function.   Write code to complete raise_to_power(). Note: This example is for practicing recursion; a non-recursive function, or using the built-in function math.pow(), would be more common. Sample output with inputs: 4 24^2 = 16   def raise_to_power(base_val, exponent_val): if exponent_val == 0: result_val = 1 else: result_val = base_val * ''' Your solution goes here ''' return result_val user_base = int(input()) user_exponent = int(input()) print('%d^%d = %d' % (user_base, user_exponent, raise_to_power(user_base, user_exponent

4.6.1: Recursive function: Writing the base case.   Add an if branch to complete double_pennies()'s base case.Sample output with inputs: 1 10Number of pennies after 10 days: 1024 Note: If the submitted code has an infinite loop, the system will stop running the code after a few seconds, and report "Program end never reached." The system doesn't print the test case that caused the reported message   # Returns number of pennies if pennies are doubled num_days timesdef double_pennies(num_pennies, num_days):total_pennies = 0 ''' Your solution goes here ''' else:total_pennies = double_pennies((num_pennies * 2), (num_days - 1)) return total_pennies # Program computes pennies if you have 1 penny today,# 2 pennies after one day, 4 after two days, and so onstarting_pennies = int(input())user_days = int(input()) print('Number of pennies after', user_days, 'days: ', end="")print(double_pennies(starting_pennies, user_days))

Take Test: Final Exam Theory 202 A Question Completion Status: 1. 2 4. 6. 9. 10 11 12 13 21 QUESTION 17 Determine the output generated by the partial C code given. #include #include void main() { int a=9, b=4,c=0; c= pow(sqrt(b)+sqrt(a),2); printf("%d, %d and %d", a, b, c ); For the toolbar, press ALT+F10 (PC) or ALT+FN+F10 (Mac).

Q1.1. Write a NumPy program to get the following array by using loops Output: array([[ 1, 2, 3, 4, 5, 6, 7, 8, 9], [2, 4, 6, 8, 10, 12, 14, 16, 18], [3, 6, 9, 12, 15, 18, 21, 24, 27], [4, 8, 12, 16, 20, 24, 28, 32, 36], [5, 10, 15, 20, 25, 30, 35, 40, 45], [6, 12, 18, 24, 30, 36, 42, 48, 54], [7, 14, 21, 28, 35, 42, 49, 56, 63], [8, 16, 24, 32, 40, 48, 56, 64, 72], [9, 18, 27, 36, 45, 54, 63, 72, 81]]) Q1.2. Replace all odd numbers in array with -1. Q1.3. By using numpy functions and prog array, get the result. prog = np.array([1,2,3,4,6]). Result= array([1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 6, 6, 6, 6, 6, 6, 6, 6, 1, 2, 3, 4, 6, 1, 2, 3, 4, 6, 1, 2, 3, 4, 6, 1, 2, 3, 4, 6]) Q1.4. Write a NumPy program to create random 2 array and size of arrays should be 1x15. In your array there should be integer numbers from 0 to 9 and by using numpy function, find common numbers in your array. Q1.5. Write a NumPy program to generate 50…

python This is what i have:

CHALLENGE ACTIVITY 11.1.1: Calling a recursive function.   Write a statement that calls the recursive function backwards_alphabet() with input starting_letter.Sample output with input: 'f' f e d c b a   USE PYTHON FOR THIS!

R7.30Assuming the following declarations, find the mistakes in the statements below. struct A { int m1[2]; int m2; } struct B { A a1; A* a2; int m3; } A a; B b[2]; a.b[0].a2 = a; b.b[1].m2 = 42; c.b[2].a2 = new A; d.b[0].a1.m1 = 42; e.b[1].a2->m2 = 42;

5.6 Mat

2.4: Floating-point ACTIVITY 2.4.2. Unient types. I calify point. zyBooks catalog 556802.4192934.qx3zqy7 Jump to level 1 The reciprocal of velocity_input is 1 / velocity_input. The following program intends to read a floating-point value from input, compute the reciprocal of the value, and output the reciprocal, but the code contains an error. Find and fix the error. Ex: If the input is 0.480, then the output is: The reciprocal of velocity = 10.480 = 2.083 1 # Modify the following code 2 velocity_input = input() 3 velocity_recip = 1 / velocity_input 4 5 print(f'The reciprocal of velocity = 1 / {velocity_input: .3f} = {velocity_recip: .3f}') I