Please solve it using C++.

Note: I already have my DoublyLinkedList and Node class.

Question 1: Given a DoublyLinkedList and Node class, update DoublyLinkedList class to have in addition the following Write a recursive C++ method removeElement (inside DoublyLinkedList class) that takes as parameters alinked-istand an element x then removes all the occurrences of x on the list. For instance, if the linked list is [10, 3, 2,7, 2, 8, 9,2] then after deleting the element 2, the list becomes [10, 3, 7, 8, 9] Write a C++ method iterativeRemoveElement (inside DoublyLinkedList class) which behaves just like the method in part a but doesn't use recursion Compare the two methods, consider performance, memory and readability a. b. c