SP8732 BFIT - Best Fit

You are given a sequence of N random values (s1, s2, s3, s4, . . . . , sN) You have to find a function f(t) = a\*t+b such that the Euclidean Distance between the given sequence and the function values where t varies from 1 to N is minimum. In effect, you have to minimize  Output the values a and b for each test case, rounded up to 4 decimal places. **Input** Line 1: T /\* Number of test cases T

N/A

a b /\* Output the values a and b rounded up to 4 decimal places for each test case \*/