We want to delete the last node of a linked list. Here is an implementation of the method. void deleteLast (Node head) { Node ptr. = head; if (ptr= null) return; } while (ptr.next.next != null) ptr ptr.next; = ptr.next = null; Describe a situation when it fails and suggest a solution to fix it.