Implement the pseudocode from Section 3.5.3 that finds the last occurrence of a target in a doubly linked list.

What will be an ideal response?

```
DLNode cursor = tail.getPredecessor();
while ( cursor != head )
{
if ( cursor.getElement().equals( target ) )
return cursor;
else
cursor = cursor.getPredecessor();
}
return null;

```