1. Shell Sort (20 points) (Learning Objectives 2 and 3) The function shellsort sorts n tegers stored in array, whose size is also given. The shellsort function calls the function generate.sequence to generate a sequence used for Shell sorting. Given the size of the array to be sorted, the generate.sequence function stores the sequence in a dynamically allocated ar ray called sequence. The parameter *seq-size stores the location of the last integer in sequence If *seq-size is-1, the array sequence is empty 1 int * generate sequence (int size, int *seq size) 3 int powers 3-1; II powers of3 5 while (powers 3. Slze // nezt int in sequence // nezt powers of 3 in sequence 15 16 // increment seq count 18 19 20 21 seq count++; sequence [seq_ count]- k; // save k in sequence if (sequence [next_idx]*2 > powers_3) I/ determine the next k kpowers 3; powers 33; /Ik is some 3 g else ksequence [next idx] 2; // k is 2 next_idx++ some int in sequence 24 // .e., k is some 2"p 3^q 27 28 *seq sizeseq_count; return sequence; 30 31 void shellsort (int array, int size) int seq size; int sequencegenerate_sequence (size, &seq size); for seq size > 0; seq size- I/ step through int in sequence 35 int gapsequence [seq_size]; //in reverse order 37 38 39 40 41 42 43 int for (jgap;j 0&&temp