Design a recursive algorithm called Extrema (, p, ) that, given an array [1⋯] finds and returns both the min and max of the subarray [p⋯] as an ordered pair: (min([p⋯]), max([p⋯])). Your algorithm should perform exactly ⌈3/2⌉−2 array comparisons on an input array of length . (Hint: Section 9.1 of the text describes an iterative algorithm that does this.)

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.

What is the explicit formula for this sequence? -7, -4, -1, 2, a.) an = 8 + (b - 1)3 b.) an = -7 + (n - 1)3 c.) an = 3 + (n -1) (-7) d.) an = -7 + (n - )

Will possibly give brainliest and a high rating. choose the linear inequality that describes the graph. the gray area represents the shaded region. 4x + y > 4 4x – y ≥ 4 4x + y < 4 4x + y ≥ 4