Plz do fast

Language: C Step 1: Randomly generate 40 numbers in the range of 0 to 20 (include 0 and 20) and store these 40 numbers in an array. Then write a function to remove duplicate numbers and output the array after removing duplicates. Step 2: write a function named partition to input (unsorted_array, left_index, right_index) then return the position(index) of the pivot. Inside the partition function initialize the pivot as the number unsorted_array[right_index] then sort all numbers in range left_index and right_index to the left and right side of the pivot(smaller or larger than pivot) Step 3: write a recursive function named quicksort to input (unsorted_array, left_index, right_index) then call partition function inside quicksort function to get the index of current pivot index. (see pseudocode above for detail) Then sort the unsorted array from step 1 and output the sorted array