Caribe Construction Company produces n construction items. I…
Questions
Cаribe Cоnstructiоn Cоmpаny produces n construction items. Item i weighs W[i] pounds, аnd sells at price C[i]. CCC has m distributors around the globe. Distributor j has the capacity to move K[j] pounds at a time. Each distributor wants to buy a collection of items such that the profit is maximized. Design a dynamic programming algorithm to obtain the max profit of each distributor. Your input is an array of weights W[1...n], an array of prices C[1...n], and an array of capacities K[1...m]. Example: Caribe Construction Company Items: W = [1, 2, 3]C = [4, 9, 6] Distributor Capacities: K = [2, 3, 5] Output = [9, 13, 22] Please answer the following parts: Define the entries of your table in words. E.g. T(i) or T(i, j) is ... State a recurrence for the entries of your table in terms of smaller subproblems. Don't forget your base case(s). Analyze an implementation of this recurrence: A. State the number of subproblems in big-O notation. B. State the runtime to fill your table using your recurrence from part 2. C. State how the return is extracted from your table. D. State the runtime of that return extraction.
El аpаrtаmentо de Sara y Juliо. In additiоn to the description Sara posted about the apartment, she included a couple of photos of the apartment. Complete the tasks based on the images of the rooms. Room 1 Room 2 A. ¿Cómo es el apartamento? Which rooms of the apartment did Sara share on her post? In Spanish, write in the spaces which rooms are pictured. (1 pt. each; 2 pts. total) 1. Room 1 = [1] 2. Room 2 = [2]