2 Which XXX would replace the missing statement in the following algorithm? It inserts (newNode) aftercurNode .List::InsertAfter(curNode, newNode) {null) {if (headhead = newNode=3=tail= newNode}XXX {tail»next = newNodenewNode--prevnewNodetail =tail}else {sucNode = curNode»nextnewNodenext = sucNodenewNode--prevcurNode»nextcurNodenewNodesucNodeprev}}= newNodeelse if (curNodetail)else if (curNode != head)else if (curNodehead)==else if (sucNodetail)==

This question is from the subject data structure. Here we are going to insert a newNode from avail…

Which XXX would replace the missing statement in the following algorithm? It inserts newNode after curNode. List::InsertAfter(curNode, newNode) { if (head == null) { head = newNode tail = newNode XXX { tail-next = newNode newNode prev = tail tail = newNode else { sucNode = curNode--next newNode-next = sucNode newNode»prev = curNode curNode»next = newNode sucNode »prev = newNode } } else if (curNode tail) else if (curNode != head) else if (curNode == head) else if (sucNode == tail)