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:

I)

You are given 4 items as {value, weightpairs in this format {{20,5}, {60,20}, {25, 10},{X, 25}}You can assume that the array is sorted based on the ratio. The capacity of knapsack is 53. The item no. 4 (whose weightis 25) is taken fractionally to fill upto the knapsack capacity. That fraction is represented in format. What is the lowest possible value of a? value weight For the question above, assume the total value stored in the knapsack is 145 after you have filled upto the knapsack capacity. What is the value of X(in other words, the value of the item no. 4) ? Give your answer to at least two decimal places