ALGORITHMS

These are part of same problem. Please solve both properly. I dont need deatails. just make sure the right answer.. I just need the correct answer. You can use shorcuts but please give solve as fast as possible. I am running Out of time kindly do faster.

Question:

Lets say you are travelling to an island by your boat. Your boat is lightweight and you need to keep it as light as possible. The boat has cargo capacity of 120kg. Your weight is 85kg. rest you can fill up with food. You want to be light weight but have maximum calorie. You have 5 packs of food(rice flour lentil honey sugar) printed with total calorie on the pack. rice flour lentil honey sugar(20,15,10,5,2kgs)packs have 205,210,215,220,230 cal respectively. What is highest possible calorie you can take with you. 907.35 905.75 875 981 Which of the following is not true for Greedy algorithm: Greedy algorithm does not always give optimal solution Greedy algorithm only think of one step ahead only Greedy algorithm is easy to implement with less space complexity 0-1 knapsack is an example of greedy algorithm Which one here is greedy algorithm? farctional knapsack 0-1 knapsack both None