Write a program where 2 linked lists have ben create and now the main task is to merge the linked lists and display the merged list. For example, merging lists {1, 2, 3} and {7, 13, 1} should yield {1, 7, 2, 13, 3, 1} Note:  the above mentioned task is to be performed using doubly linked list and in C++

Write in c++ please

Complete the missing code then compile, debug and test your program using the command lines below: c++ -o project1 project1.cpp <enter> ./project1 n m k <enter> Where n is the size of the stack, m is the modular of the real part and imagination part of a random complex number, and k is the number of elements displayed per line. In the main function, you need to Get the values n, m, and k from the command line. Declare a complex number stack of size n, generate n random complex numbers and push them into the stack. Meantime display all these numbers, k numbers per line. Display all elements of the stack, k elements per line. Create two random complex numbers c1 and c2, display c1, c2 and the results of the addition c1+c2, the subtraction c1-c2, the multiplication c1*c2, and the division c1/c2. #include <iostream> #include <cstdlib> #include <ctime> using namespace std; class Complex {…

C++ Code  Use the following list to sort it and create a single linked list: 6,13,7,11,9,2,15,5,3,4,10,14 Also make a list of the available memory.  Print the list out with the links.   Now delete 11 from the list, adding its location to the available memory list, then add 1 and 8 to the list.   When you add the 1 you should use the location of the deleted 11 to add 1 there.  Add 8 to the next available spot on the available memory list.   When you print the list, print out the logical list using the links and also print out  physical list without the links to see what the real list looks like.

PLEASE SEPARATE EACH SOURCE CODE

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…

Please do it on c++ don't use stl function must read the instruction

No explicit loops must be used. In C# Suppose variable nums contains a list of integers.List«Integer> nums = Arrays.asList(1, 1, 2, 3, 4, 1, 3, 2, 4, 3, 3, 1);var nums = new List<int> { 1, 1, 2, 3, 4, 1, 3, 2, 4, 3, 3, 1 }; // C#Using Java Stream API *or* LINQ, write a short code that prints the following.For each section indicate the platform (whether the solution is given in Java orC#  ILINQ).A) Print all numbers.B) Print the sum() of the numbers.C) count how many times number '1' appears in the list.