An outline of the Class definition of a doubly linked list is given below. Using only the methods given here, write the method

void List :: delete(int )

that deletes an element at position pos in the range 0,1,2,, count-1. You may assume that the value of pos is valid (i.e. 0<=pos

template

struct Node {

// data members

Node_entry entry;

Node *next;

Node *back;

// constructors

Node();

Node(Node_entry, Node *link_back = NULL,

Node *link_next = NULL);

};

typedef Node_entry List_entry

template

class List {

public:

// add code here

protected:

// Data members

int count; // number of entries in the list

Node *head; // points to the first item of the list

}