Objectives Segmented Least Squares- Running time Segmented Least Squares DP[O] = 0; least Err + for (j-l; j i; j++) do (n+r)s n => eji = LeastSquareError(j, i); C X error = eji + C + DPLi-11; : if least Errerror then (o) 5 least Err = error: pointerlt]-j end end DP[i] = least Err: end Analyse the running time of the above algorithm as a function of n the number of observations. Assuming that Line () requires c ( -i) primitive operations for some constaut c