Please explain, C programing   Q# Is there a difference between the heap and stack memory?   Selection the answer below:   A. Yes, stack memory is automatically allocated and cleared when a function is called. The heap is otherwise managed by using malloc and free.   B. No, they are identical.

Stack ADT Implement a program in C++ that has the following three parts and each does the following: 1. Implements in C++, the specification of a Stack ADT with all the Main and Helper behaviors (save the file as StackADT.h) 2. Implements in C++, all the necessary methods (behavior) of the StackADT (save the file as StackADT.cpp) 3. Implements in C++, a main function (the client or application program) that creates and uses Stack objects (save the file as StackMain.cpp). This main function should be able to do the following: a. It should be able to read a given text file as input, b. It should be able to get each input value from the input file (one word at a time) and store it (push) on the StackADT object until it stores all the words from the input file. c. It should be able to retrieve an item from the stack and 1) display it on the screen, as well as 2) write it to an output file, and then delete (pop) that item from the stack, and repeat this process until it retrieves all the…

All parts are in C# 3Is data in C# allocated on a stack or on a heap or both? If it is both stack and heap, then explain what data is allocated where. Use terms such as stack-dynamic, heap-dynamic (fixed and generic). What is the mechanism to deallocate heap-allocated data, if any (programmer-controlled or automatic garbage collection)? Is data mutable or immutable or both? If both, then explain what data is mutable and what data is not. In what ways are variables defined and bound to the type (explicit vs implicit, statically vs dynamically bound)? Show examples.

I need help with this C++ data structure course - Show the steps for sorting the following heaps [8,5,6,2,3] in ascending order using heap sort.