At the beginning of the first day (day 1) after grape harvesting is completed, a grapegrower has 8000 kg of grapes in storage. At the end of day n, for n = 1, 2, . . . , the grape grower sells 250n/(n + 1) kg of their stored grapes at the local market at the price of $1.50 per kg.During each day the stored grapes dry out a little so that their weight decreases by 2%.Let wn be the weight (in kg) of the stored grapes at the beginning of day n for n ≥ 1. Find a recursive definition for wn. Draw a timeline.  Find the value of wn for n = 1, 2, 3.  Let rn be the total revenue (in dollars) earned from the stored grapes from the beginning of day 1 up to the beginning of day n for n ≥ 1. Write a program to compute wn and rn for n = 1, 2, . . . , num where num is entered by the user, and display the values in three columns: n, wn, rn with appropriate headings.Run the program for num = 20. (Use format bank.)  Use  program to determine how many days it will take to sell all of the grapes. //This is all one question please.It is easy for me to understand if you answer all together//

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
100%

 At the beginning of the first day (day 1) after grape harvesting is completed, a grapegrower has 8000 kg of grapes in storage. At the end of day n, for n = 1, 2, . . . , the grape grower sells 250n/(n + 1) kg of their stored grapes at the local market at the price of $1.50 per kg.During each day the stored grapes dry out a little so that their weight decreases by 2%.Let wn be the weight (in kg) of the stored grapes at the beginning of day n for n ≥ 1.
Find a recursive definition for wn. Draw a timeline.
 Find the value of wn for n = 1, 2, 3.
 Let rn be the total revenue (in dollars) earned from the stored grapes from the beginning of day 1 up to the beginning of day n for n ≥ 1.
Write a program to compute wn and rn for n = 1, 2, . . . , num where num is entered by the user, and display the values in three columns: n, wn, rn with appropriate headings.Run the program for num = 20. (Use format bank.)
 Use  program to determine how many days it will take to sell all of the grapes.

//This is all one question please.It is easy for me to understand if you answer all together//

Expert Solution
steps

Step by step

Solved in 3 steps with 2 images

Blurred answer
Knowledge Booster
Knapsack Problem
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education