Write a C program that:

$1.$ Dynamically allocates an array of integers of size n $($input by the user$).$

$2.$ Implement the following functions using pointers:

o Initialize the array: Use a pointer to initialize the array with random values

ranging $[-200,200]($without using array index notation$).$

o Print the array: Using pointer notation when traversal through the array

$($without using array index notation$).$

o Reverse the array: This function reverses all elements in the array by using

pointers.

o Remove duplicate elements: This function removes duplicate values from

the array in$-$place, optimizing the use of memory and minimizing the number

of shifts. It means no sortings.

o Find and print the maximum and minimum values: Implement this

function with $2$ pointers that hold the addresses of max and min values. Use

pointers when traversal through the array.

o Shift the array elements: This function will cyclically shift elements of the

array by k positions to the right or left based on user input $($use pointer

manipulation, no index$-$based shifting$).$

The program should handle possible errors, such as allocation failures, and provide

meaningful output for the operations with clear labels. You should call the printArray after

each of the $$reverseArray$,$removeDuplicates$$ and $$shiftArray$$ with proper labels.

Expected Functions:

void initializeArray$($int$*$ arr, int n$)$;

void printArray$($char$*$ label, int$*$ arr, int n$)$;

void reverseArray$($int$*$ arr, int n$)$;

int removeDuplicates$($int$*$ arr, int n$)$;

int findMaxMin$($int$*$ arr, int n$,$ int $*$maxPtr$,$ int minPtr$)$;

void shiftArray$($int$*$ arr, int n$,$ int k$,$ int direction$)$