We have to implement a stack using an array that is implemented dynamically at run time. The program should be able to work so that it can use any data type

You are to implement a stack using arrays. The array should be implemented dynamically at run time. The concept of dynamic arrays enables the programmer to implement algorithms independently of the length of the arrays used. The index ranges of dynamic arrays are not to be defined until run-time. Stacks have various applications like evaluation of expressions, reversing a string, etc. In each of these applications,there can be a situation when you don't know the number of elements that need to be pushed into the stack. In such cases, the array needs to be created dynamically. You are to push and pop items into a stack. Then, traverse and finally delete the stack. Your ADT should implement the stack using dynamic arrays, and it should work for any datatype even if it is tested using a particular [login to view URL] data file may contain only character strings to be inserted in the stack, but define your ADT such that it works for items of any data type. You will be given sentences, and will be required to push each character of the sentence into a stack. The number of characters in the string will be known at run-time, when the data is read from the data file. The first thing you need to do is to create an empty stack. Then push the items into the stack, which is to be implemented as a dynamic array. The required memory block will have to be allocated at run-time, using malloc. A push operation would mean to increase the array size and add items at the top of the stack. Popping an item would mean to physically delete the item from the stack, and decrease the size of the array. Finally, delete the stack and free the memory block that was allocated for the stack. The data file that was given to us is as follows: push this is thefirstline pop 4 push this is the nextline pop 21 print push good luck push this is the last assignment for the semester pop 15 print delete_stack ## Deliverables Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. Complete copyrights to all work purchased. ## Deadline information This must be completed bye Saturday December 1 at midgnight.