Chessboard distance or Minkowski distance

Consider two objects and describe by 10 features and write a c-program to compute Lr distance by the varying the “r-value”. The C-program automatically reads the 10 random number and the value of r going to increment automatically up to 50. Our infinity value is set to 50, can be changed to the desired value. the r-value is 1 then it is called the city-block distance, if the value of r is 2 then it is called Euclidean distance and if the value of r is infinity then it is called as a chessboard or Lr distance, supremum distance (also referred to as L max , L ∞ norm and as the Chebyshev distance ) is a generalization of the Minkowski distance for L → ∞. The C-program automatically reads the 10 random number and the value of r going to increment automatically up to 50. Our infinity value is set to 50, can be changed to the desired value. The c-program is as follows: #include<stdio.h> #include<stdlib.h> #include<math.h> #include<floa...