1. Use an array to implement a stack of numbers. Items may only be pushed and popped to and from the top of the stack. Create modules for Push, Pop, I s Full, and I s Empty.2. Write a procedure that...

popped to and from the top of the stack. Create modules for Push, Pop, I s Full, and I s Empty.2. Write a procedure that will convert an array of numbers to a linked list of numbers. This procedure should have two parameters: a pointer to the head of the linked list and an array. Use a loop in your answer. Do not use recursion. Assume that the array is already full of numbers-you don't need to read them in . Declare any necessary data types you need to solve this exercise.