This is question E5 from Datastructures and Program Design in C++ by R. L. Kruse (page 232). I need answer for part "(l) remove "

Here' everything from section 6.1:

E5. Indicate which of the following functions are the same for doubly linked lists (as implemented in this section) and for simply linked lists. For those that are different, write new versions for doubly linked lists. Be sure that each function conforms to the specifications given in Section 6.1. (a) The constructor List (b) The copy constructor (c) The overloaded assignment (g) empty (h) full (i) replace G) insert operator (d) The destructor List (e) clear () size (k) retrieve (1) remove (m) traverse E5. Indicate which of the following functions are the same for doubly linked lists (as implemented in this section) and for simply linked lists. For those that are different, write new versions for doubly linked lists. Be sure that each function conforms to the specifications given in Section 6.1. (a) The constructor List (b) The copy constructor (c) The overloaded assignment (g) empty (h) full (i) replace G) insert operator (d) The destructor List (e) clear () size (k) retrieve (1) remove (m) traverse