Please solve the attached problem.  It's from previous semester.  It would be great if you provide explanation along with answer coding.  

 

Problem 3Consider the following class that implements a doubly-linked list of integers with no dummy node.Thelast node’snextpointer is NULL; the Frst node’sprevpointer is NULL.There is no tail pointer.When thelist is empty,headis NULL.class LinkedList{public:…int countAdjacentMatches () const;void eraseLast (){if (head != NULL)eraseLastAux (head);}void writeDi± (const LinkedList& other) const{wd (head, other.head);}private:struct Node{int value;Node* next;Node* prev;};Node* head;void eraseLastAux (Node* h);void wd (const Node* p1, const Node* p2) const;};a.ThecountAdjacentMatchesmember func²on counts how many nodes have a value that is equalto the value of the node that immediately follows it in the list.³or examples, if the LinkedListacontained nodes with the values 3 6 6 17 4 4 4 8 4 7, then the calla.countAdjacentMatches()returns 3, because it counted the Frst 6 and the Frst two 4s.Write thecountAdjacentMatches()member func²on no more than 15 lines long.int LinkedList::countAdjacentMatches() const{no more than 15 lines}

Attachments:

• 1495596740-Problem 3-tutor.docx