Implement the extended_bottom_up_cut_rod() function by following the pseudo code, so that the algorithem can now print the choices (cuts) that lead to the optimal revenue. def extended_bottom_up_cut_rod(prices, n): ### START YOUR CODE ### r= None # Initialize with float('-inf') and List comprehension r[e] = e s= None # Initialize with float('-inf') and List comprehension for j in None: # Specify the range 9 - float('-inf') for i in None: # specify the range pass # Implement the if statement r[j] - 9 ### END YOUR CODE #** return r, s def print_cut_rod_solution(s, n): ### START YOUR CODE ### while None: # Specify the range print(s[n-1], end=', ') n = None # Update n ### START YOUR CODE ### # Do not change the test code here prices - [1, 5, 8, 9, 10, 17, 17, 20, 24, 30] r, s = extended_bottom_up_cut_rod(prices, 9) print(s) print(r[9]) print_cut_rod_solution(s, 9) Expected output: [1, 2, 3, 2, 2, 6, 1, 2, 3] 25 3,6,
Implement the extended_bottom_up_cut_rod() function by following the pseudo code, so that the algorithem can now print the choices (cuts) that lead to the optimal revenue. def extended_bottom_up_cut_rod(prices, n): ### START YOUR CODE ### r= None # Initialize with float('-inf') and List comprehension r[e] = e s= None # Initialize with float('-inf') and List comprehension for j in None: # Specify the range 9 - float('-inf') for i in None: # specify the range pass # Implement the if statement r[j] - 9 ### END YOUR CODE #** return r, s def print_cut_rod_solution(s, n): ### START YOUR CODE ### while None: # Specify the range print(s[n-1], end=', ') n = None # Update n ### START YOUR CODE ### # Do not change the test code here prices - [1, 5, 8, 9, 10, 17, 17, 20, 24, 30] r, s = extended_bottom_up_cut_rod(prices, 9) print(s) print(r[9]) print_cut_rod_solution(s, 9) Expected output: [1, 2, 3, 2, 2, 6, 1, 2, 3] 25 3,6,
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...
Related questions
Question
![Task 4: Print the optimal way to cut
Implement the extended_bottom_up_cut_rod() function by following the pseudo code, so that the algorithem can now print the choices (cuts) that lead to
the optimal revenue.
In [ ]: def extended_bottom_up_cut_rod(prices, n):
### START YOUR CODE ###
r = None # Initialize with float('-inf') and List comprehension
r[e] = e
s = None # Initialize with float('-inf') and List comprehension
for j in None: # Specify the range
9 = float('-inf')
for i in None: # Specify the range
the if statement
pass # Implemen
r[j] = q
### END YOUR CODE ###
return r, s
def print_cut_rod_solution(s, n):
### START YOUR CODE ###
while None: # Specify the range
print(s[n-1], end=',')
n = None # update n
### START YOUR CODE ###
In [ ]: # Do not change the test code here
prices -D [1, 5, 8, 9, 10, 17, 17, 28, 24, за]
r, s = extended_bottom_up_cut_rod(prices, 9)
print(s)
print(r[9])
print_cut_rod_solution(s, 9)
Expected output:
[1, 2, 3, 2, 2, 6, 1, 2, 3]
25
3,6,](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F00477006-7591-4aef-977b-f91fd68b5ce3%2F21fe132c-9e3a-4b5a-ab06-50b92e201d7f%2F58f269_processed.png&w=3840&q=75)
Transcribed Image Text:Task 4: Print the optimal way to cut
Implement the extended_bottom_up_cut_rod() function by following the pseudo code, so that the algorithem can now print the choices (cuts) that lead to
the optimal revenue.
In [ ]: def extended_bottom_up_cut_rod(prices, n):
### START YOUR CODE ###
r = None # Initialize with float('-inf') and List comprehension
r[e] = e
s = None # Initialize with float('-inf') and List comprehension
for j in None: # Specify the range
9 = float('-inf')
for i in None: # Specify the range
the if statement
pass # Implemen
r[j] = q
### END YOUR CODE ###
return r, s
def print_cut_rod_solution(s, n):
### START YOUR CODE ###
while None: # Specify the range
print(s[n-1], end=',')
n = None # update n
### START YOUR CODE ###
In [ ]: # Do not change the test code here
prices -D [1, 5, 8, 9, 10, 17, 17, 28, 24, за]
r, s = extended_bottom_up_cut_rod(prices, 9)
print(s)
print(r[9])
print_cut_rod_solution(s, 9)
Expected output:
[1, 2, 3, 2, 2, 6, 1, 2, 3]
25
3,6,
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 3 steps
Recommended textbooks for you
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 Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
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 Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
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
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY