Consider the following node structure for a doubly linked list: struct dNode int _value; dNode* _next; dNode* _prev; Suppose you have created a list of 4 nodes using this structure and have maintained a pointer to the first node in a variable named head as shown in the diagram below: dNode* head dNode value= 3 -next = prev-nullptr dNode value= 93 next= nullptr Prev = dNode dNode value = -next = _prev = value = 72 -next = Prev = CSE 250 Fall 2017 Using this setup, answer the following questions. a. Write one line of code to obtain the value 3 from this list. b. Write one line of code that would obtain the value 72 from this list. c. Write one line of code that would obtain a pointer to the second node in this list. (2+2+1+1+1 points, 7 total) With the doubly linked list in mind, answer the following questions a. b. 2) Draw the list after the node containing 5 is removed, updating links as needed What values would need to be updated in order to properly maintain the list if you were to delete the node containing 5. Write the code that would get access to these values that need to be updated (e.g., if head's_prev value needed to be updated, you could write head->_prev as one of the answers) c. Add the value 80 into the list from your answer in part (a), maintaining sorted order d. Add the value 0 into the list from your answer in part (c), maintaining sorted order. e. Add the value 100 into the list from your answer in part (a), maintaining sorted order