lab data structor (c++)

1) Define a node structure as STRUCT. 2) Define a class template oflinkedListIterator. 3) Define a class template of LinkedListType. 4) Define a class template of unorderedLinked Listinherited from the classLinkedListType. 5) Test your program on a double unordered linked-list in the main function. Hint. The class should have the following functions: template classunorderedLinkedList: public linkedListType { public: bool search(const Type&searchltem) const; voidinsertFirst(const Type&newitem); voidinsertLast(const Type&newltem); voiddeleteNode(const Type&deleteltem); }; Assignment. Define a class template of ordered LinkedListinherited from the classLinkedListType, which includes the following functions: template classorderedLinkedList: public linkedListType { public: bool search(const Type&searchltem) const; void insert(const Type&newltem); voidinsertFirst(const Type&newltem); voidinsertLast(const Type&newltem); voiddeleteNode(const Type&deleteltem); }