Write a C program that calculates the best rotation for vector Y to minimize the difference with X Given two vectors X and Y of length N, where N is limited to 100. The difference between these two vectors is (I I means the absolute value) We would like to rotate y by a specific number in order to minimize the difference. The rotation is circular rotation. What is that number? In case of tie, we choose the shortest shift/rotation. The input is as follows (from the standard input the vector length (N) vector x vector y For example 5 14723 17 23 4 56 77 The output is a single number between 0 and 4 (since the length is 5, a shift of 5 is the same as a shift of 0) Rotation is to the right 147 23 17 23 4 56 77 Shift of 4 (r-to the right), added information not displayed distance 65 156 248 shift of 0 (distance 6 7456 28 651423 shift of 0 4) Write a C program that calculates the best rotation for vector Y to minimize the difference with X Given two vectors X and Y of length N, where N is limited to 100. The difference between these two vectors is (I I means the absolute value) We would like to rotate y by a specific number in order to minimize the difference. The rotation is circular rotation. What is that number? In case of tie, we choose the shortest shift/rotation. The input is as follows (from the standard input the vector length (N) vector x vector y For example 5 14723 17 23 4 56 77 The output is a single number between 0 and 4 (since the length is 5, a shift of 5 is the same as a shift of 0) Rotation is to the right 147 23 17 23 4 56 77 Shift of 4 (r-to the right), added information not displayed distance 65 156 248 shift of 0 (distance 6 7456 28 651423 shift of 0 4)