C++

The class IntList below implements a singly linked list with a head sentinel node. It defines a private nested data structure Node, which represents a node of this linked list:

class IntList {

public:

void removeElements(int val);

private:

struct Node {

int data;

Node *next;

Node(int d, Node* n = NULL) : data(d), next(n) {

}

};

Node* head;

};

Complete the implementation of the function removeElements that removes a certain element in the list:

/**

Given a linked list and a value, remove all instances of that value by modifying the list in place.

Given: a linked list 1 --> 6 --> 3 --> 5 --> 6 and a value 6

The list should become: 1 --> 3 --> 5

*/

void IntList::removeElements(int val) {

// TODO: you code here

**PLEASE INCLUDE SCREENSHOTS**