Write a C program that sorts a 13x13 diamond containing 85 disks of varying diameter and hue. Rearrange it where each row includes monotonically increasing hue from left to right and each column includes monotonically increasing diameter from top to bottom. Follow the code outline that I have attached below. I have also included an example of what the output should look like.

6 This program sorts a diamond array of disks of varying hues and 7 diameters. 9 Iinclude 10 #include 12 int main (int arge, char argv) 13 int Arrayt1691 14 int NumVals: 15 int Load Mem(char , inti 16 void Print Array(int *: 17 18 if (argc- 2) 19 20 21 22 NumVals - Load Mem(*+Hargv, Array): printf ("usage: exit (1); %s valuefile ", argv[0]); 23 it (umVals85) printf("not exit (1) 24 25 26 27 28 / your code goes here 29 30 Print Array (Arrayi 31 exit (0) 32 enough values in %s ", argv[0]); 34 /* This routine initializes a 13 x 13 array with zeros. Then it loads 35 85 memory elements trom the input file. The values are loaded in 36 address: value cuples. The first value is loaded into position 6. all 37 other values are positioned relative to the address of the first word. 38 The number of loaded values are returned. 39 40 int Load Mem (char InputrileName, int Arrayli i 41 int N, Addr, Value, Index, NumVals: 42 int Base--1: 43 FILE *FP: 45 for (N-o: N