In C, using malloc to allocate memory for a linked list uses which memory allocation scheme? O Heap allocation Static allocation

In C++    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.

Please fill in the blanks for C. // Singly Linked List   #include<stdio.h>   // Part 1 //Declare a node of character // each node has a value and a pointer that points to the next node struct charNode {             __1__ val;             __2__ __3__ next; };   /*This function takes the first pointer (head) and iterates through the list             to print one character at a time.*/ __4__ printCharLL(__5__ __6__ curPtr) {             printf("\nPrinting back the list: \n");             while(__7__ __8__ __9__) //condition to keep running the loop             {                         printf("%c", __10__);  //print the value using pointer, no spaces                         curPtr = __11__; //move the pointer to point to the next node in list, no spaces             }             printf("\n"); }   // Part 2 //Declare a node of double // each node has a value and a pointer that points to the next node struct doubleNode {             __12__ val;             __13__ __14__ next; };…

Q2: Stack stores elements in an ordered list and allows insertions and deletions at one end.The elements in this stack are stored in an array. If the array is full, the bottom item is dropped from the stack. In practice, this would be equivalent to overwriting that entry in the array. And if top method is called then it should return the element that was entered recently Please do it in C++ and use stack class(header file), not premade function