(2 pts) The diagram below exemplifies a memory model of a doubly-linked list. Each row in the memory model corresponds to a single node. Column x contains the data of each node, column next contains the reference to the memory location of the next node, and column prev contains the reference to the memory location of the previous node. Fill the empty doubly-linked list diagram below using the memory model. Please note that references to the next node are represented by green arrows, while references to the previous node are represented with blue arrows. The head of the list has been filled for you. (3 pts) Suppose the name of the doubly-linked list from problem 3 is dil. For each method call in the series of method calls below: (a) Draw the diagram of the list after the method call. (b) Identify the memory location of head and tail of the list after the method call. dll. remove (0) dll. remove (5) dll.append (' X ') \# new node added to memory bin 245 dll.set (3, ' B ') dll.add (2, 'A') dll. reverse()