Write single linked list class member functions push_front, pop_front and front. The function signatures and the basic modes of operation can be described as follows:

void push_front(const int &) { insert(0, din); }

void pop_front() { erase(0); }

const int &front() { node *p=findnode(0); return p->data; }

Your job is to implement each of these functions without calling other list member functions. Instead make explicit use of pointers when relinking and accessing the nodes. Submit only the code for these three functions.