For our Gradient Descent algorithm, the cost function $=\backslash$Sigma $($Y$($mX$+1))2$

and our learning rate $=0\mathrm{.}01.$

We are interested in approximating a value for the parameter m using three points. Y is the true y$-$coordinate of each point and X is the true x$-$coordinate.

We initialize m with $0$ and the new m is calculated as the old m $-(0\mathrm{.}083$m $-124)*0\mathrm{.}01.$

$($a$)$ What is the first step size?

$($b$)$ what does $\text{'}0\mathrm{.}083$m$-124\text{'}$ in the formula to compute the new m represent?

$($c$)$ Write a conditional expression based on the information provided above that will stop the looping of the algorithm, resulting in a determined value of the parameter.