C++ program to delete each alternate node of a singly linked list. For Example: 1->2->3->4->5->6->7->8->NULL                       should be restructured to            1->3->5->7->NULL Note: use c++ solve as soon as possible

Write C code that implements a soccer team as a linked list. 1. Each node in the linkedlist should be a member of the team and should contain the following information: What position they play whether they are the captain or not Their pay 2. Write a function that adds a new members  to this linkedlist at the end of the list.

Problem overview As you may already know from earlier courses, integer values in C++ (as well as other programming languages) are limited by the number of bits used to represent these data. For instance, a 64-bit unsigned integer has the maximum value of 2^64 - 1 or 18446744073709551615. One method of representing integers of arbitrary length, which was covered last spring, is a a linked list data structure such that that a node in the linked list corresponds to a single digit in the integer. For instance, the number 123 can be stored as linked-list that could look like this: [ 3 ] -> [ 2 ] -> [ 1 ] -> NULLNote that the first (or head) node in this list contains the least significant digit (in this case 3), while the last node contains the most significant digit (1). For this problem, you are to read in pairs of arbitrary length integers and produce correct output as outlined below. InspirationNote, this problem is inspired by Problem 8.19 from Elements of Programming…

Write a function with the signature below that returns the sum of the last k elements of a singly linked list that contains integers. int returnSumOfLastKNodes(Node* head, int k)   Example: 10 -> 5->8->15->11->9->23 10 represents the head node, returnSumOfLastKNodes(Node* head, 4) will return 58.