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 data of the detroit pistons in numerical order from least to greatest is 0.30, 0.37, 0.55, 0.62, 0.69, 0.72, 0.73, 0.75, 0.77, 0.78, 0.80, 0.81, 0.81, 0.83, 0.84, 0.89

the data of the miami heat in numerical order from least to greatest is 0.50, 0.50, 0.56, 0.57, 0.67, 0.72, 0.72, 0.72, 0.75, 0.75, 0.76, 0.81, 0.82, 0.90, 1.00, 1.00

the detroit pistons median : 1.52

the miami heat median: 1.47

the iqr of this data is 0.05

p(x)= 8 x³ - 36 x² + 54 x - 27

q(x) = 2 x -3

you can check your mistake and then you can choose the correct option.

dividend =   8 x³ - 36 x² + 54 x - 27

divisor = 2 x -3

if you want to find quotient, proceed as follows

q(x)= 0

2 x - 3=0

x =

now , i have used division method , to find quotient and remainder