I. Take an array of structures that includes n student records. Each student record consists of student name, roll no, and marks. II. Implement the following functions:
A. Push () // to push an element in the array B. Pop(): I/ to remove an element from the array
C. Top(): // to return the last inserted element without removing it.
D. Size(): // to return the number of elements stored in the stack. E. int IsEmpty Stack(): // to check whether any elements are stored in the stack or not.
If empty print “Stack is underflow”. F. int IsFullStack(): // to check whether the stack is full or not.
If full print “Stack is overflow”.