1. A circular doubly linked list Abstract Data Type has a private header pointer, called 1st , which points to the first node of a circular doubly linked list. This ADT does not maintain a specific header pointer to the last node of the list. Given a pointer to a node n, assume that values can be read or written to by using the field names n.prev, n.val and n.next for the previous, value and next fields of the node respectively. Assume that a garbage collector is being used, so nodes do not need to be explicitly freed. Use END for invalid or null address pointer values. cddl_delete_last is a member function of the ADT that removes the last element from the list (if there is one). Fill in the missing part of the pseudocode for this function below: i void cddl_delete_last () 2 { // WRITE THE CODE THAT SHOULD BE HERE 3 4 return 5 }