Give a polynomial-time algorithm that takes a sequence of supply values s1, s2, . . , sn and returns a schedule of minimum cost. for example, suppose r = 1, c = 10, and the sequence of values is

Since opening night, attendance at play a has increased steadily, while attendance at play b first rose and then fell. equations modeling the daily attendance y at each play are shown below, where x is the number of days since opening night. on what day(s) was the attendance the same at both plays? what was the attendance? play a: y = 8x + 191 play b: y = -x^2 + 26x + 126 a. the attendance was never the same at both plays. b. the attendance was the same on day 5. the attendance was 231 at both plays on that day. c. the attendance was the same on day 13. the attendance was 295 at both plays on that day. d. the attendance was the same on days 5 and 13. the attendance at both plays on those days was 231 and 295 respectively.

From the beginning of the day the temperature rose 15 degrees so that by 4 pm it was 87 degrees. what was the temperature at the start of the day

With alll of except for the 2 that i did already