A doubly linked list consists of nodes that include two references: one called next to the next node in the linked list, and one called prev to the previous node in the linked list. The first node in such a list has a prev field whose value is null, and the last node has a next field whose value is null.

The top portion of the diagram below shows a doubly linked list of characters that could be used to represent the string "set".

Each of the nodes shown is an instance of the following class:

public class DNode $\{$

private char ch;

private DNode next;

private DNode prev;

$\}$

$($In the diagram, we have labeled the individual fields of the DNode object that contains the character $\text{'}$s$\text{'}.)$

In addition to the list representing "set", the diagram shows an extra node containing the character $\text{'}$a$\text{'},$ and two reference variables: n$,$ which holds a reference to the second node in the list $($the $\text{'}$e$\text{'}$ node$)$; and m$,$ which holds a reference to the $\text{'}$a$\text{'}$ node. The diagram also shows memory addresses of the start of the variables and objects. For example, the $\text{'}$s$\text{'}$ node begins at address $0$x$180.$

Complete the table we have provided in ps$2\_$partI, filling in the address and value of each expression from the left$-$hand column. You should assume the following:

The address of the ch field of a DNode is the same as the address of the DNode itself

The address of the next field of a DNode is $2$ more than the address of the DNode itself

The address of the prev field of a DNode is $6$ more than the address of the DNode itself, which means that it is also $4$ more than the address of the next field.