We talked about a doubly linked list where nodes are linked in both directions.

The class Node which the list comprises of is given below.

Like your last assignment Use your Firstname instead of ItemType

template

class Node

$\{$

Firstname ln;

Node$*$ successive;

Node$*$ previous;

$\}$

Where data $($ ln $)$ is the first three letters of your lastname.

Implement a Templatized Sorted doubly link list class called SortDblLnkLstFn where Fn is your first name

and make sure that it has all the functions that a regular link list has such as:

i$.$ Constructor

ii$.$ Destructor

iii. Copy constructor

iv$.$ Assignment Operator

v$.$ findItem $//$ finds a given item in the list. Returns true if found.

vi$.$ putItem $//$ Inserts an item into a DblLinkList object

vii. deleteItem $//$ Deletes an item from an already existing DblLinkList object

viii. printItems $//$Prints the info of all items in the list.

ix$.$ printItemsReverse$//$Prints the items in reverse from the last node to first using the

properties of a doubly linked list.

You can add any other functions or datamembers as required for your implementation.

Please add a main to test all your functions above and do not use struct.