Removal of a linear linked list in c++. Show how to do the following recursively. Assume each node is an integer and LLL length is randomly generated at runtime: A) Remove the first node B) Remove the last node C) Remove the last two nodes D) Remove the node after every 2 E) Remove all nodes

Per Chegg rules, this is one question with multiple subparts.