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)

Assume that characters were represented by 43 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, weightpairs {{40,20}, {30, 10}, {20,5}}The capacity of knapsack=19. Find the maximum value output assuming items to be divisible