Consider a variant of the matrix-chain multiplication problem in which the goal is to parenthesize the sequence of matrices so as to maximize, rather than minimize, the number of scalar multiplications. Does this problem exhibit optimal substructure

the answer is: the length is 5/6 yards.

give me a or a 5 star rating if this is correct!

step-by-step explanation:

(1, –1), (16, –4), (36, –6)

step-by-step explanation:

given that the function is

this can also be written as

we have to graph this function and check which list of points lie on the graph

see attachment for graph:

we find that the points lying are (1,-1) (16,-4) and (36,-6)

since square root is there we find that x can only be posiitve but y can be since square root both positive and negative.

answer: (3,11) is your answer.

what are the