Which XXX would replace the missing statement in the given algorithm for traversing a circular linked list? CircularListTraverse(head) { if (head is not null) { current = head do { visit current current = current⇢next } while (XXX) } } Group of answer choices current == head current == tail current != head current != tail

Which XXX would replace the missing statement in the following algorithm to remove a node from the singly-linked list? ListRemoveAfter(list, curNode) {if (curNode is null && list⇢head is not null) {sucNode = list⇢head⇢nextlist⇢head = sucNodeif (sucNode is null) {XXX}}else if (curNode⇢next is not null) {sucNode = curNode⇢next⇢nextcurNode⇢next = sucNodeif (sucNode is null) {list⇢tail = curNode}}} Group of answer choices list⇢head = sucNode   sucNode = list⇢head⇢next   list⇢tail = curNode   list⇢tail = null