Write a C program that takes a sorted integer array as input and removes duplicates in place (means modifying the original data structure directly without allocating additional memory) using pointers. Pointers make this implementation different and efficient because they allow you to directly manipulate memory addresses, enabling you to avoid creating a new array and minimizing the number of swaps or shifts required during duplicate removal. The program should print the array with duplicates removed. Note: Test your function by calling it in main with different input arrays. Arrays can be hardcoded. Implementation Details: */ Function: printUniqueElements prints unique elements from the pointer array Parameters: inputArray: Pointer to an integer array. lenArray: The length of the input array. Returns: void Note: - In a sorted array, all duplicate elements appear together. - This function prints the array with duplicates removed. void printUniqueElements (int *inputArray, int lenArray); Example 1: int inputArray[] = {1, 1, 2, 3, 3, 4, 4, 5, 5}; int len = sizeof(inputArray) / sizeof(inputArray[0]); printUniqueElements (inputArray, len); Result: Unique Elements: 1 2 3 4 5 Example 2: int inputArray[] = {2, 2, 3, 3, 3, 4, 5, 5, 5}; int len = sizeof(inputArray) / sizeof(inputArray[0]); printUnique Elements (inputArray, len); Result: Unique Elements: 2 3 4 5 This function printUniqueElements takes an array of sorted integers and its length as parameters. It prints the unique elements from the sorted array, with duplicate elements removed.