Arrange the steps for inserting an element into a stack:

a$)$ Return the element

b$)$ Create a new node for the element

c$)$ Set the top pointer to the new node

d$)$ Push the element onto the stack

e$)$ Check if the stack is full