Write this function given the template for linked lists in C++ with the given requirements:

Given implementation of Linked list that can be helpful for writing function:

IMPLEMENTATION: template class List private: // struct for singly-linked list nodes struct Node T data: Node next; Node (const T &dTI, Node *n - nullptr) :datad, nextin /Data members of List class: a front and back pointer Node front; Node *back; QUESTION: Function: linked list remove occurence Description: removes all occurrences of x (if any) in given list (calling object) returns number of matches found/deleted Relative order of undeleted elementsis unchanged. Requirements: O() Worst case runtime Function Template (Cannot change paremeters) int fast remove all (const T &x) return 0