Given

x$>=0$

$,$ use Swann's bounding algorithm to bound and then solve $($as per above instructions$)$: Minimize

f$($x$)=$x

$2$

$+$x$2$

x

$$

$-$ Work out $5$ steps of each algorithm by hand, and create a table with all pertinent information for Golden Section search; refer the table format in the lecture handout $($ignore the "uncertainty" column$).$ For Newton Raphson, create a table reporting the

x$,$f

$$

and

f

$$

at each iteration.