You are given n items sorted based on value ratio and the knapsack capacity is W. Now, what is the time complexity of fractional knapsack problem? weight O(n log n) O(n) O(n*n) O(nW) You are given 4...

Extracted text: You are given n items sorted based on value ratio and the knapsack capacity is W. Now, what is the time complexity of fractional knapsack problem? weight O(n log n) O(n) O(n*n) O(nW) You are given 4 items as {value, weight} pairs in this format {{20, 5}, {60, 20}, {25, 10}, {X, 25}}. You can assume that the array is sorted value weight ratio. The capacity of knapsack is 39. The item no. 4 (whose weight is 25 ) is taken fractionally to fill upto the knapsack based on the capacity. That fraction is represented in format. What is the lowest possible value of a? For the question above, assume the total value stored in the knapsack is 132 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.