ease,help me by providing C++ programing solution. Do not use the LinkedList class or any classes that offers list functions. Implement a LinkList in C++. Pease,implement with an ItemType class and a NodeType struct The program should read a data file,and the data file has two lines of data as follow: 100, 110, 120, 130, 140, 150, 160 100, 130, 160 The program will first add all of the numb

You are going to 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 homework.  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   1. create an empty unsorted list  2. 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().  3. 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()..   4. 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…

What would be a way in implementing the Josephus problem in C++ using a vector or a list? That takes in three parameters, one the number of knights for the knight parameter. The second parameter, "skip", is the number of knights to skip and to execute the next night. Then the third parameter "start", is the index of the knight to execute first.

In c++ please

You may do this assignment using either Java or C++. Do *not use the JDK LinkedList class or any linked list library! A linked list consists of zero or more nodes, which each contain one item of data and a link (Java reference, C++ pointer or reference) to the next node, if there is one. Linked List code is usually generic, so that you can use it to create a list of Strings, Students, Doubles, etc. For this assignment, you will write a simplified version of linked list that only can be used to create and use a list of ints and that has only a few of the functions typical of linked lists. The data element can be just an int, and the data type of the link to the next node can be just Node. You will need a reference (Java) or either a reference or a pointer (C++) to the first node, as well as one to the last node. Write a method/function that takes an in, creates a node with that int as its data value, and adds the node to the end of the list. This function will need to update the…

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…

Please do this in C++.  The only parts needed are commented as //TODO in MAIN. Please do not use cout, the PrintNodeData in MileageTrackerNode.cpp needs to be called. I am struggling with adding data into the linked list.     Given the MileageTrackerNode class, complete main() to insert nodes into a linked list (using the InsertAfter() function). The first user-input value is the number of nodes in the linked list. Use the PrintNodeData() function to print the entire linked list. DO NOT print the dummy head node. Ex. If the input is: 3 2.2 7/2/18 3.2 7/7/18 4.5 7/16/18 the output is: 2.2, 7/2/18 3.2, 7/7/18 4.5, 7/16/18 Main.cpp #include "MileageTrackerNode.h"#include <string>#include <iostream>using namespace std; int main (int argc, char* argv[]) {// References for MileageTrackerNode objectsMileageTrackerNode* headNode;MileageTrackerNode* currNode;MileageTrackerNode* lastNode; double miles;string date;int i; // Front of nodes listheadNode = new…

Assume that, you have a Linked List class "LL" with a function named "fun1". You can assume that "value" is the value of the nodes and "Next" is the next pointer of the node. You created an instance of the LL class, named "L1", where "head" is the head node. And you inserted the following numbers:  31 -> 32 -> 43 -> 17 -> 34 -> 57 ->91. What will be the output of the linked list L1 after the "fun1" operation to it?*           31 -> 32 -> 43 -> 17 -> 34 -> 57 ->91       31 -> 32 -> 17 -> 34 -> 57 ->91       31 -> 32 -> 43 -> 17 -> 57 ->91       31 -> 32 -> 43 -> 17 -> 34 -> 57       31 -> 32 -> 43 -> 57 ->91       31 -> 32 -> 43 -> 34 -> 57 ->91

In C++.

In C++, write a program that reads in an array of type int. You may assume that there are fewer than 20 entries in the array. The output must be a two-column list. The first column is a list of the distinct array elements and the second column is the count of the number of occurences of each element.