kindly, to show the answer in details, along with writing matlab code$11\mathrm{.}7$ The path of steepest ascent is usually computed

assuming that the model is truly first order; that is$,$ there is

no interaction. However, even if there is interaction, steep$-$

est ascent ignoring the interaction still usually produces good

results. To illustrate, suppose that we have fit the model

hat$(y)=20+5x_1-8x_2+3x_1{x}_2$

using coded variables $(-1x_i+1).$

$($a$)$ Draw the path of steepest ascent that you would obtain

if the interaction were ignored.

$($b$)$ Draw the path of steepest ascent that you would obtain

with the interaction included in the model. Compare this

with the path found in part $($a$).$