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 6. What is the value of a +b? Given items as {value, weightpairs {{40,20}, {30, 10}, {20,5}}The capacity of knapsack=21. Find the maximum value output assuming items to be divisible