18. Swap the value of the second node with the value of the node before last.
19. Swap the last node with the node before last.
20. Swap the value of the last node with the value of the node before last.
21. Move the first two nodes (or more) to the end of the calling object. This will require resetting pointer first, and last if it is a doubly-linked list, and all other necessary pointers to connect the list.
22. Move the last two nodes (or more) to the front of the calling object. This will require resetting pointer first, and last if it is a doubly-linked list, and all other necessary pointers to connect the list.
23. Search for specific values (all odds, all evens, all multiples of some integer, etc.) and return the number of occurrences.
24. Search for specific values (all odds, all evens, all multiples of some integer, etc.) and add a node at the end (or beginning) of the list. The node will store the number of occurrences.
25. Search for specific values (all odds, all evens, all multiples of some integer, etc.) and return true if at least one occurrence of that specific value is found.
26. Rotate a list to the left (or right) by rotating the nodes. You will need to reset pointers.
27. Rotate a list to the left (or right) by rotating the values stored in the nodes. No pointers will be reset.

PLEASE HELP ME TO WRITE THESE FUNCTIONS FOR STUDY c++

THESE FUNCTIONS HAVE NO PARAMETERS

thank you so much