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 times def 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 on starting_pennies = int(input()) user_days = int(input()) print('Number of pennies after', user_days, 'days: ', end="") print(double_pennies(starting_pennies, user_days))

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
100%
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 times
def 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 on
starting_pennies = int(input())
user_days = int(input())

print('Number of pennies after', user_days, 'days: ', end="")
print(double_pennies(starting_pennies, user_days))

entry level cyb x
E Home
Gradebook
zy Section 4.6 -C X
O (234) ITS128 F X
2 python - LAB: X
b Answered: 3.1 X
* Search Results X
G 3.8.1: Basic inh x
+
i learn.zybooks.com/zybook/CYB_135_54915392/chapter/4/section/6
= zyBooks My library > CYB/135: Object-Oriented Security Scripting home > 4.6: Creating recursion
E zyBooks catalog
? Help/FAQ
Kenneth Schultz -
U raise
Feedback?
CHALLENGE
4.6.1: Recursive function: Writing the base case.
АCTIVITY
Add an if branch to complete double_pennies()'s base case.
Sample output with inputs: 1 10
Number 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.
346682.2019644.qx3zay7
1 # Returns number of pennies if pennies are doubled num_days times
2 def double_pennies (num_pennies, num_days):
total_pennies = 0
1 test
passed
3
4
5
''' Your solution goes here '''
6
All tests
7
else:
passed
total_pennies = double_pennies((num_pennies * 2), (num_days - 1))
8
10
return total_pennies
11
12 # Program computes pennies if you have 1 penny today,
13 # 2 pennies after one day, 4 after two days, and so on
14 starting_pennies = int(input())
15 user_days = int(input())
16
17 print('Number of pennies after', user_days, 'days:
18 print(double_pennies(starting_pennies, user_days))
', end="")
Run
11:48 PM
O Type here to search
77°F Cloudy
9/17/2021
Transcribed Image Text:entry level cyb x E Home Gradebook zy Section 4.6 -C X O (234) ITS128 F X 2 python - LAB: X b Answered: 3.1 X * Search Results X G 3.8.1: Basic inh x + i learn.zybooks.com/zybook/CYB_135_54915392/chapter/4/section/6 = zyBooks My library > CYB/135: Object-Oriented Security Scripting home > 4.6: Creating recursion E zyBooks catalog ? Help/FAQ Kenneth Schultz - U raise Feedback? CHALLENGE 4.6.1: Recursive function: Writing the base case. АCTIVITY Add an if branch to complete double_pennies()'s base case. Sample output with inputs: 1 10 Number 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. 346682.2019644.qx3zay7 1 # Returns number of pennies if pennies are doubled num_days times 2 def double_pennies (num_pennies, num_days): total_pennies = 0 1 test passed 3 4 5 ''' Your solution goes here ''' 6 All tests 7 else: passed total_pennies = double_pennies((num_pennies * 2), (num_days - 1)) 8 10 return total_pennies 11 12 # Program computes pennies if you have 1 penny today, 13 # 2 pennies after one day, 4 after two days, and so on 14 starting_pennies = int(input()) 15 user_days = int(input()) 16 17 print('Number of pennies after', user_days, 'days: 18 print(double_pennies(starting_pennies, user_days)) ', end="") Run 11:48 PM O Type here to search 77°F Cloudy 9/17/2021
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY