Exercise 6 Now find values of beta_0 and beta 1 that minimize ssr(y, x, beta_o, beta_1) for given x and y. Write a function min ssr(y, x, beta_0_min, beta_0_max, beta_1 min, beta_1_max, step) as follows: , a) Find these values by evaluating ssr(y, x, beta_0, beta 1) over every combination of of (Bo, B1) in two lists. b) Create lists beta_0_list and beta 1 list from ranges Bo = Bmax and B1 Brin Brax, where the neighboring values of Bo or B1 are separated by distance step. c) Start with min SSR = 999999. Loop over the index numbers i and j, corresponding to lists beta_O_list and beta 1.list. d) For each pair of i and j, extract the value beta_0_list[i] and beta 1.list[j]. e) For each pair of i and j, evaluate SSR(y, x, 30, 31). If it is lower than min SSR, record the new i min = i and j_min j and update the newest value of min SSR. f) After the loops, return [ beta_O[i min), beta-1 [j min] ]