Write the problem code in c$++$ & run it$.$ Problem: Given an array of n $(1<=$ n $<=1000)$ integers $($not necessarily unique$),$ write a C program that considers each integer in the array one$-$by$-$one, and

inserts them in a linked list in non$-$descending order, and print the linked

list. Write a C code to remove duplicates from the linked list, and print the

resulting list. Given an integer k$,$ write a C code to reverse every k integers

in the linked list, and print the k$-$reversed list.

$$ Input: n $=10$ A$[]=\{8,7,1,1,8,9,6,3,2,4\}$ k $=3$

$$ Output:

$$ Sorted List with duplicates: $1123467889$

$$ Sorted List with no duplicates: $12346789$

$3-$Reversed List: $32176498$