Vito wants to minimize the total distance to all of them and has blackmailed you to write a program that solves his problem. inputthe input consists of several test cases. the first line contains the number of test cases. for each test case you will be given the integer number of relatives r ( 0 < r < 500) and the street numbers (also integers) s1, s2, si, sr where they live ( 0 < si < 3 ). note that several relatives could live in the same street number. outputfor each test case your program must write the minimal sum of distances from the optimal vito's house to each one of his relatives. the distance between two street numbers si and sj is dij= |si-sj|.sample input22 2 43 2 4 6sample output24

The boeing 747 is an air plane often equipped with four pratt and whitney jt9d engines that can each offer 193.50 kn of thrust. the air plane has a cruise speed of 907 km/hour, and typical cruise altitudes are of 11 km where the air temperature is -56 °c and density is 0.36 kg/m^3. its coefficient of drag at cruise conditions is 0.031, using the total wing area of 511m^2 as the reference area. its maximum take-off mass is 333000 kg a) what is the plane's coefficient of lift during cruise at its maximum take-off mass? b) what percentage of maximum thrust is required to keep the plane cruising? c) what is the plane's maximum angle of ascent? use the coefficient of lift calculated in part a). the following may be of : a cos(x) + bsin(x) = r cos(x-a) where r = va2+52 and a = tan(b/a)