Implement a program that creates an unsorted list by using a linked list implemented by yourself. NOT allowed to use LinkedList class or any other classes that offers list functions. It is REQUIRED to use an ItemType class and a NodeType struct to solve this. Use C++!

The data.txt file has three lines of data

100, 110, 120, 130, 140, 150, 160

100, 130, 160

1@0, 2@3, 3@END

You need to

create an empty unsorted list

add the numbers from the first line to list using putItem() function.

Then print all the current keys to command line in one line using printAll().

delete the numbers given by the second line in the list by using deleteItem() function.

Then print all the current keys to command line in one line using printAll()..

putItem () the numbers in the third line of the data file to the corresponding location in The list. For example, 1@0 means adding number 1 at position 0 of the list.

Then print all the current keys to command line in one line using printAll()..

Implement the following functions by yourself and use them

putItem(parameter one is the object to be added): append the object at the end of the list.

putItem(parameter one is the object to be added, parameter two is the position starting From 0): insert the item at the position.

deleteItem(parameter is the key which is an integer): remove the item

getItem(parameter is an index value which starts from 0) returns the item object reference

printAll(parameter is the pointer that points to the beginning of the list), print all keys in Order in the list.

PLEASE make sure the test data file matches exactly how it is displayed up there so I can also run it with the same type of data file! Please show output, and please post solution WITHOUT linked list class! Example output is added in image.

Elements of list after inserting first line elements: 100>110>120>130>140>150>160>NULL Elements of list after deleting second line items: 110>120>140>150> NUL Elements of list after deleting second line items: 1>120>140>150>3>NULL