Write a line of code that creates an array for 100 decimal numbers in the heap, then write another line of code to reclaim the used heap memory

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.

C++ programming language.