Recall the set up for HW7 Q2: Now assume that for each type of metal, all of the bars are fused together so that you're forced to all the bars of a certain type, or none of them. This means that you sometimes should not take the metal that has the highest value, because it either will not fit all in your bag (since you have to take all the bars), or other metals of lesser will be worth more overall value when combined together. Write bestValueForFused, which takes in the the size of your bag, the counts of all metals, and the value of all metals, and returns the value of the best picks possible. Your code must use recursion and should run in O(2^N) where N is the total number of metals (aka counts. length and values. length). bestValueForFused(4, [], []) // 0 (the cave is empty) bestValueForFused(4, [4, 10, 2], [3, 1, 5]) // 12 (take metal 0, even though metal 2 is worth more per bar) bestValueForFused(4, [4, 2, 2], [3, 2, 5]) // 14 (take metal 1 and metal 2) bestValueForFused(6, [4, 2, 1], [3, 3, 5]) // 18 (take metal 0 and metal 1)