code segment

can someone give me a hand with a few code segments [login to view URL] that a linked-list based stack is not empty, how do a add a new item under the top elementof the stack, assuming that the stack is a linked-list. void PushUnder (node * StackPointer, DataType item) { [login to view URL] a Recurrsive function tht will return the number of nodes in a linked list with head pointer "head" int Length (node * head) { [login to view URL] a function that will remove a node in a double, circular linked-list with a header (dummy head node). the function is to remove the node after node pointed to by pointer. Assuming pointer is pointing to the node Before the one to be delete void RemoveAfter (node * head, node * &pointer) { ## Deliverables 1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request. 3) Complete ownership and distribution copyrights to all work purchased. ## Platform windows Dos