in data structures write a function to rearrange the integer linked list such that odd items coming first  c++

Write a program in c++ to remove duplication if exists in the linked list. Write 2 separate functions to perform search and other to perform the duplication removal.   Note: the above mentioned task is to be performed using singly linked list and in c++

Using c++ Contact list: Binary Search   A contact list is a place where you can store a specific contact with other associated information such as a phone number, email address, birthday, etc. Write a program that first takes as input an integer N that represents the number of word pairs in the list to follow. Word pairs consist of a name and a phone number (both strings). That list is followed by a name, and your program should output the phone number associated with that name. Define and call the following function. The return value of FindContact is the index of the contact with the provided contact name. If the name is not found, the function should return -1 This function should use binary search. Modify the algorithm to output the count of how many comparisons using == with the contactName were performed during the search, before it returns the index (or -1). int FindContact(ContactInfo contacts[], int size, string contactName) Ex: If the input is: 3 Frank 867-5309 Joe…

Write a merge function that takes pointers to two sorted lists as arguments and returns a pointer to a merged list in C++. Please explain with detailed. Thank you!