Consider the following linked structure of integer items. Write a single C++ statement that will achieve each of the following. Note that you can use any of the three pointers i.e., Data, ptr1, and ptr2. Moreover, you only need to modify the structure as required: there is no need to free allocated memory. a) Change the node containing 45 to hold 20 b) Test if there is a node after that of value 90 c) Remove the 3rd node from the linked structure d) Remove the last 3 nodes from the linked structure