B. (15 points) Complete the code that will delete every other node of the linked list. If the linked list is empty then return NULL, otherwise return the pointer to the new list. For example, if the Ist contains [3, 5, 2, 1 resulting list returned after the deletion should have [3, 2, 8]. OR If ist is 13, 5, 2, 1], the deletion will result in [3, 2] , 8], the Node deleteEveryother (Node 1st) i if (ist- NULL) return NULL // till the rest of the code. It needed, see the LList code in appendix