Consider the following game. a "dealer" produces a sequence s1 · · · sn of "cards," face-up, where each card si has a value vi. then two players take turns picking a card from the sequence, but can only pick the first or the last card of the (remaining) sequence. the goal is to collect cards of the largest total value. (for example, you can think of the cards as bills of different denominations.) assume n is even. a. show a sequence of cards such that it is not optimal for the first player to start by picking up the available card of larger value. that is, the natural greedy strategy is suboptimalb. give an o(n2) algorithm to compute an optimal strategy for the first player. given the initial sequence, your algorithm should precompute in o(n2) time some information, and then the first player should be able to make each move optimally in o(1) time by looking up the precomputed information.

can you rephrase the question ? it is unclear : -)

step-by-step explanation:

p ÷ r = tan(x)

step-by-step explanation:

given that there is a figure below shows a right triangle: a right triangle is shown with hypotenuse equal to q units and the length of the legs equal to p units and r units.

graph is missing so i will create the graph as per given information.

the angle between the legs having lengths p units and q units is y degrees. the angle between the legs having lengths r units and q units is x degrees.

now we need to find about what is p ÷ r equal to.

so we can use trigonometric ratio tan(x)=[altitude]/[base] to find the value of p ÷ r, because p is the altitude and r is the base.

p ÷ r=tan(x)

hence final answer is p ÷ r=tan(x).

the answer is c: divide the arc's degree measure by 360°, then multiply by the circumference of the circle.

central angle of a triangle has the same measure as its intercepted arc.

step-by-step explanation: