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:

Part B 10.0 points possible (graded, results hidden) You are given n items, and the knapsack capacity is W. Time complexity of fractional knapsack problem is O[n logn) O(n) Dn*n] O(n) Assume that characters were represented by 22 bits before compression. Let the best compression ratio (compressed size / uncompressed size) achievable on any string using any Huffman tree is What is the value of a +b? Given items as {value, weight} pairs {{40,20}, {30, 10}, {20,5}}. The capacity of knapsack=21. Find the maximum value output assuming items to be divisible