Consider the following game tree, where one of the leaves has an unknown payoff, x. player 1 moves first, and attempts to maximize the value of the game. each of the next 3 questions asks you to write a constraint on x specifying the set of values it can take. specify your answer in one of the following forms: write all if x can take on all values write none if x has no possible values use an inequality in the form x< {value}, x> {value}, or {value 1}16. note that the answer check is sensitive to ordering, spacing, and capitalization, so do not use spaces in your answers and make sure the form matches the examples above.

the value of v.w= -12.

step-by-step explanation:

we are given three vector r,v and w as:

r = < 5, -5, -2> ; v = < 2, -8, -8> ; w = < -2, 6, -5>

we know that r,v and w could also be represented as:

r=5i-5j-2k

v=2i-8j-8k

and w= -2i+6j-5k

where i,j and k are the unit vectors of x,y and z-axis respectively.

also we know that it has the following property:

i.i=1 ; j.j=1; k.k=1

and i.=j.i=i.k=k.i=j.k=k.j=0

i.e. when we multiply two vectors or we find it's dot product we need to only multiply the components of x coordinates with each other; y with each other and z with each other.

hence, v.w= (2i-8j- -2i+6j-5k)

                  = 2×(-2)+(-8)×(6)+(-8)×(-5)

                  = -4-48+40

                  = -12

hence, v.w= -12

cool? what is the actuall ?

step-by-step explanation: