Fill in the gaps indicated by ??? to complete the implementation of deleteLast.

deleteLast() { if (head!= null) {

// The list has no nodes

if (head.next==null) { // The list has one node head= ???

} else {

// The list has at least two nodes

SLLNode temp= ??? // search for the next but last node....

while(temp.next.next!=null) { temp= ??? } // Hint: what node does temp point to now?

temp.next= ??? } } }