image (1)

Problem #4: Two infamous thieves, Denver and Nairobi, planned to rob the famous Louvre Museum. Before the scene, they both agreed on the fact that none of them will break any item as all the items in the museum are too precious, and taking a fraction of any item won't sell on the black market. If it fits in the bag as a whole, they will take it, otherwise, leave it as it is. Both of them arrived at the Royal Treasury with an empty knapsack weighing a total of 7 kg each. Even though both thieves are experts in their fields, they take slightly different approaches. Denver believes he will use a Dynamic Programming Approach to rob the items in the most efficient manner possible. Nairobi, on the other hand, believes that if she chooses a Greedy Approach, she will make the most money. The objects in the Royal Treasury Museum are listed below. Objects Diamond Jewelry Sculpture Painting Gold Crest Profit ($) 3 4 12 9 12 Weight (kg) 1 2 8 4 5 a) Simulate your dynamic programming algorithm to find the maximum profit Denver can make. b) From your memory/dp table, find out which items would he take to make this amount of profit? c) Does Nairobi's belief remain valid after the robbery? Prove it.