use the following definition for both parts:

class node {

boolean data;

node link;

}

Consider a structure using a linked list in which you added and removed from the back of the list.Using the node definition above, write the pseudocode for a member method add to this structure.Assume the existence of a front and back reference.

---------------------

Assume you are working with a stack implementation of the linked list definition above (above question #7), write a member method pop. The method should return a value (in the popped node). Assume the existence of the node references called TheStack and Top. These references point to the start (or bottom) and top of the stack (or back of the list