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)

Jason, samantha, ravi, sheila, and ankit are preparing for an upcoming marathon. each day of the week, they run a certain number of miles and write them into a notebook. at the end of the week, they would like to know the number of miles run each day, the total miles for the week, and average miles run each day. write a program to them analyze their data. your program must contain parallel arrays: an array to store the names of the runners and a two-dimensional array of five rows and seven columns to store the number of miles run by each runner each day. furthermore, your program must contain at least the following functions: a function to read and store the runners’ names and the numbers of miles run each day; a function to find the total miles run by each runner and the average number of miles run each day; and a function to output the results. (you may assume that the input data is stored in a file and each line of data is in the following form: runnername milesday1 milesday2 milesday3 milesday4 milesday5 milesday6 milesday7.)

(328 inc. 448 ind. 480 in25. john has a collection of toy cars. he has 2 red cars, 4 blue cars, 4 black cars, and 6 yellowcars. what is the ratio of red cars to yellow cars? a. 1: 2b. 1: 3c. 1: 626. the net of a right triangular prism is shown below.

What is the name of the sound effect that danny hears