Suppose you want to minimize the following function using steepest descent

algorithm.

$f(x_1,x_2)=x_1^2+2x_2{x}_1+x_2^2+1$

At iteration $0$ you start from $x_1=1,x_2=1,$

a$)$ What is the next value of $x_1,$ and $x_2$ at iteration $1?$ Use $=0\mathrm{.}1.$

b$)$ What is the next value of $x_1,$ and $x_2$ at iteration $1,$ if you use Newton's method?